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 18:48Josu San MartinJosu San MartinScore: 5,130Success
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 18:495,01455,954,17540,320,0001,301,0002,359,296
2May 9, 2026 18:495,09657,184,68941,028,0001,269,0002,355,200
3May 9, 2026 18:495,11461,422,90341,408,0001,042,0002,351,104
4May 9, 2026 18:495,11759,653,49041,437,0001,037,0002,351,104
5May 9, 2026 18:495,13057,974,55941,289,0001,292,0002,351,104
6May 9, 2026 18:495,17660,028,44541,902,0001,059,0002,338,816
7May 9, 2026 18:495,27462,022,15842,756,0001,024,0002,355,200
8May 9, 2026 18:495,30965,433,99143,022,0001,043,0002,342,912
9May 9, 2026 18:495,67966,392,89146,102,0001,036,0002,347,008