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 listSep 1, 2026 07:26Victor MerckléVictor MerckléScore: 4,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 07:274,83748,316,21439,042,0001,109,0002,117,632stderr
2Sep 1, 2026 07:274,84548,611,34039,087,0001,128,0002,117,632stderr
3Sep 1, 2026 07:274,85048,662,07739,139,0001,120,0002,117,632stderr
4Sep 1, 2026 07:274,85048,736,85139,144,0001,113,0002,117,632stderr
5Sep 1, 2026 07:274,85248,775,69239,167,0001,110,0002,117,632stderr
6Sep 1, 2026 07:274,86448,771,46939,259,0001,119,0002,117,632stderr
7Sep 1, 2026 07:274,86748,805,34539,257,0001,143,0002,117,632stderr
8Sep 1, 2026 07:274,88459,450,99039,388,0001,150,0002,117,632stderr
9Sep 1, 2026 07:274,91057,076,89139,552,0001,201,0002,117,632stderr