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 25, 2026 19:50Maya RebholzMaya RebholzScore: 6,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 19:515,94660,152,98944,163,0005,190,0002,113,536
2May 25, 2026 19:515,96158,987,51144,426,0005,054,0002,113,536
3May 25, 2026 19:515,97959,718,98144,037,0005,589,0002,117,632
4May 25, 2026 19:515,98959,477,43044,441,0005,274,0002,117,632
5May 25, 2026 19:516,03861,006,95444,450,0005,669,0002,113,536
6May 25, 2026 19:516,11660,312,30745,255,0005,508,0002,113,536
7May 25, 2026 19:516,13462,311,25045,278,0005,639,0002,117,632
8May 25, 2026 19:516,18461,504,37645,621,0005,710,0002,117,632
9May 25, 2026 19:516,52366,153,23548,500,0005,644,0002,117,632