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 26, 2026 23:19Victor MerckléVictor MerckléScore: 3,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 23:203,78439,782,80230,227,0001,181,0002,117,632stderr
2Aug 26, 2026 23:203,79040,485,49530,320,0001,145,0002,117,632stderr
3Aug 26, 2026 23:203,79339,793,29430,342,0001,145,0002,117,632stderr
4Aug 26, 2026 23:203,80639,862,91630,509,0001,081,0002,117,632stderr
5Aug 26, 2026 23:203,80740,682,07930,418,0001,182,0002,117,632stderr
6Aug 26, 2026 23:203,81239,928,63230,504,0001,143,0002,117,632stderr
7Aug 26, 2026 23:203,82339,969,39230,606,0001,130,0002,117,632stderr
8Aug 26, 2026 23:203,94841,821,58531,639,0001,130,0002,117,632stderr
9Aug 26, 2026 23:204,00241,505,78832,140,0001,079,0002,117,632stderr