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:54Josu San MartinJosu San MartinScore: 4,797Success
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:544,70952,709,70737,889,0001,201,0002,379,776
2May 9, 2026 22:544,73654,618,81438,117,0001,198,0002,379,776
3May 9, 2026 22:544,76054,911,99538,291,0001,221,0002,375,680
4May 9, 2026 22:544,79454,342,32738,603,0001,193,0002,371,584
5May 9, 2026 22:544,79754,445,39138,617,0001,205,0002,363,392
6May 9, 2026 22:544,80057,152,53138,660,0001,183,0002,375,680
7May 9, 2026 22:544,82558,224,86938,855,0001,196,0002,367,488
8May 9, 2026 22:544,90360,216,84539,487,0001,210,0002,379,776
9May 9, 2026 22:544,98856,562,98040,190,0001,212,0002,379,776