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 listSep 14, 2026 13:09Kevin HeaveyKevin HeaveyScore: 3,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 13:103,53838,164,50628,142,0001,225,0002,113,536
2Sep 14, 2026 13:103,67239,302,63529,273,0001,206,0002,113,536
3Sep 14, 2026 13:103,72140,422,09729,668,0001,222,0002,113,536
4Sep 14, 2026 13:103,76340,740,62030,027,0001,213,0002,113,536
5Sep 14, 2026 13:103,81041,131,25430,593,0001,035,0002,113,536
6Sep 14, 2026 13:103,82640,626,56330,561,0001,196,0002,113,536
7Sep 14, 2026 13:103,83542,396,24230,625,0001,207,0002,113,536
8Sep 14, 2026 13:103,88541,798,35231,107,0001,140,0002,113,536
9Sep 14, 2026 13:103,90641,259,53831,408,0001,014,0002,113,536