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 24, 2026 22:06Victor MerckléVictor MerckléScore: 3,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 22:063,84140,299,42230,757,0001,130,0002,117,632stderr
2Aug 24, 2026 22:063,85140,361,79630,854,0001,112,0002,117,632stderr
3Aug 24, 2026 22:063,86440,470,27730,898,0001,179,0002,117,632stderr
4Aug 24, 2026 22:063,86740,501,67830,979,0001,125,0002,117,632stderr
5Aug 24, 2026 22:063,86940,524,01730,928,0001,187,0002,117,632stderr
6Aug 24, 2026 22:063,87340,560,51231,025,0001,128,0002,117,632stderr
7Aug 24, 2026 22:063,88040,604,32131,027,0001,184,0002,117,632stderr
8Aug 24, 2026 22:063,88040,609,36231,014,0001,190,0002,117,632stderr
9Aug 24, 2026 22:063,90040,766,82831,235,0001,141,0002,117,632stderr