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 07:40Victor MerckléVictor MerckléScore: 47,322Success
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 07:4046,871397,481,777387,886,0001,146,0002,117,632stderr
2Aug 27, 2026 07:4047,059398,998,617389,499,0001,093,0002,117,632stderr
3Aug 27, 2026 07:4047,104399,310,893389,917,0001,052,0002,117,632stderr
4Aug 27, 2026 07:4047,274400,687,908391,343,0001,033,0002,117,632stderr
5Aug 27, 2026 07:4047,322401,902,842391,753,0001,021,0002,117,632stderr
6Aug 27, 2026 07:4047,347401,449,465391,866,0001,122,0002,117,632stderr
7Aug 27, 2026 07:4047,348401,268,488391,973,0001,023,0002,117,632stderr
8Aug 27, 2026 07:4048,273409,070,972399,664,0001,002,0002,117,632stderr
9Aug 27, 2026 07:4048,559411,412,133402,026,0001,017,0002,117,632stderr