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 12, 2026 01:18Victor MerckléVictor MerckléScore: 3,769Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 01:193,75139,480,27630,030,0001,110,0002,117,632stderr
2Aug 12, 2026 01:193,75339,572,72430,031,0001,123,0002,117,632stderr
3Aug 12, 2026 01:193,76641,434,92330,094,0001,165,0002,117,632stderr
4Aug 12, 2026 01:193,76839,725,42330,164,0001,113,0002,117,632stderr
5Aug 12, 2026 01:193,76940,455,94530,107,0001,182,0002,117,632stderr
6Aug 12, 2026 01:193,77139,718,13530,173,0001,133,0002,117,632stderr
7Aug 12, 2026 01:193,77639,751,70830,273,0001,073,0002,117,632stderr
8Aug 12, 2026 01:193,79339,883,28230,387,0001,095,0002,117,632stderr
9Aug 12, 2026 01:193,86440,456,17230,999,0001,074,0002,117,632stderr