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 30, 2026 19:23Josu San MartinJosu San MartinScore: 4,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:244,68847,339,36437,864,0001,053,0002,113,536
2Aug 30, 2026 19:244,69047,398,77237,902,0001,032,0002,113,536
3Aug 30, 2026 19:244,70447,485,15037,933,0001,113,0002,113,536
4Aug 30, 2026 19:244,70547,501,57237,952,0001,103,0002,113,536
5Aug 30, 2026 19:244,70647,479,58338,027,0001,035,0002,113,536
6Aug 30, 2026 19:244,71148,737,26337,964,0001,144,0002,113,536
7Aug 30, 2026 19:244,71247,549,62837,965,0001,146,0002,113,536
8Aug 30, 2026 19:244,74447,762,11038,256,0001,120,0002,113,536
9Aug 30, 2026 19:244,74547,803,91938,378,0001,012,0002,113,536