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 11, 2026 21:47Victor MerckléVictor MerckléScore: 3,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 21:483,85040,419,09730,934,0001,028,0002,117,632stderr
2Aug 11, 2026 21:483,85440,392,17930,846,0001,143,0002,117,632stderr
3Aug 11, 2026 21:483,88140,636,08031,049,0001,164,0002,117,632stderr
4Aug 11, 2026 21:483,88141,264,55831,088,0001,128,0002,117,632stderr
5Aug 11, 2026 21:483,90240,796,92731,356,0001,032,0002,117,632stderr
6Aug 11, 2026 21:483,90640,824,29131,273,0001,155,0002,117,632stderr
7Aug 11, 2026 21:483,91340,831,86331,339,0001,144,0002,117,632stderr
8Aug 11, 2026 21:483,93941,019,48631,569,0001,128,0002,117,632stderr
9Aug 11, 2026 21:483,95141,880,67731,747,0001,052,0002,117,632stderr