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 listMay 9, 2026 22:38Josu San MartinJosu San MartinScore: 5,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 22:395,01657,552,19140,420,0001,217,0002,347,008
2May 9, 2026 22:395,02958,033,46640,703,0001,038,0002,355,200
3May 9, 2026 22:395,04057,182,65440,632,0001,208,0002,342,912
4May 9, 2026 22:395,07156,143,99340,912,0001,182,0002,351,104
5May 9, 2026 22:395,08356,955,67840,974,0001,221,0002,342,912
6May 9, 2026 22:395,09057,349,12941,042,0001,209,0002,342,912
7May 9, 2026 22:395,10257,532,90541,158,0001,194,0002,342,912
8May 9, 2026 22:395,10857,225,21541,210,0001,191,0002,342,912
9May 9, 2026 22:395,17258,207,58041,900,0001,031,0002,355,200