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 21:25Josu San MartinJosu San MartinScore: 4,954Success
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 21:254,86954,761,90839,211,0001,205,0002,342,912
2May 9, 2026 21:254,92355,730,00439,639,0001,226,0002,355,200
3May 9, 2026 21:254,92956,977,03639,731,0001,183,0002,347,008
4May 9, 2026 21:254,94459,709,01639,834,0001,207,0002,351,104
5May 9, 2026 21:254,95458,125,68039,916,0001,206,0002,347,008
6May 9, 2026 21:254,98856,675,26240,205,0001,197,0002,355,200
7May 9, 2026 21:255,02159,860,94640,468,0001,207,0002,351,104
8May 9, 2026 21:255,02356,750,79740,650,0001,045,0002,347,008
9May 9, 2026 21:255,29558,987,88342,929,0001,024,0002,342,912