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 11, 2026 02:42Josu San MartinJosu San MartinScore: 10,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 02:4210,10291,220,45982,808,0001,042,0002,113,536
2May 11, 2026 02:4210,10291,459,01382,831,0001,018,0002,113,536
3May 11, 2026 02:4210,10493,226,55482,852,0001,016,0002,113,536
4May 11, 2026 02:4210,10592,693,62982,858,0001,021,0002,113,536
5May 11, 2026 02:4210,10793,384,64582,867,0001,025,0002,113,536
6May 11, 2026 02:4210,11091,196,52782,891,0001,022,0002,113,536
7May 11, 2026 02:4210,11093,685,21582,864,0001,055,0002,113,536
8May 11, 2026 02:4210,11693,048,46682,911,0001,057,0002,113,536
9May 11, 2026 02:4210,12793,688,57182,944,0001,111,0002,113,536