Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 27, 2026 01:36Victor MerckléVictor MerckléScore: 4,558Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 01:374,38244,678,96335,302,0001,074,0002,117,632stderr
2Aug 27, 2026 01:374,41044,919,00335,518,0001,087,0002,117,632stderr
3Aug 27, 2026 01:374,51146,331,22736,370,0001,073,0002,117,632stderr
4Aug 27, 2026 01:374,54846,178,84636,655,0001,097,0002,117,632stderr
5Aug 27, 2026 01:374,55846,238,80636,681,0001,157,0002,117,632stderr
6Aug 27, 2026 01:374,58247,240,77536,948,0001,090,0002,117,632stderr
7Aug 27, 2026 01:374,64646,968,73537,449,0001,118,0002,117,632stderr
8Aug 27, 2026 01:374,66247,064,15437,498,0001,199,0002,117,632stderr
9Aug 27, 2026 01:374,76055,077,37938,491,0001,017,0002,117,632stderr