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 05:49Victor MerckléVictor MerckléScore: 3,831Success
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 05:503,73339,331,13529,896,0001,089,0002,117,632stderr
2Aug 27, 2026 05:503,73939,436,67929,846,0001,190,0002,117,632stderr
3Aug 27, 2026 05:503,75640,190,18429,905,0001,274,0002,117,632stderr
4Aug 27, 2026 05:503,75939,621,60030,174,0001,026,0002,117,632stderr
5Aug 27, 2026 05:503,83140,774,56930,636,0001,164,0002,117,632stderr
6Aug 27, 2026 05:503,83540,191,75130,766,0001,072,0002,117,632stderr
7Aug 27, 2026 05:503,94441,131,18731,593,0001,143,0002,117,632stderr
8Aug 27, 2026 05:503,98542,004,44831,859,0001,222,0002,117,632stderr
9Aug 27, 2026 05:504,03941,878,63632,470,0001,058,0002,117,632stderr