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 listJul 3, 2026 18:50Josu San MartinJosu San MartinScore: 9,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 18:509,39287,347,05473,642,0004,319,0002,113,536
2Jul 3, 2026 18:509,46987,973,89873,262,0005,337,0002,113,536
3Jul 3, 2026 18:509,47288,062,30473,326,0005,299,0002,113,536
4Jul 3, 2026 18:509,51088,415,79273,591,0005,348,0002,113,536
5Jul 3, 2026 18:509,51788,338,45673,660,0005,334,0002,113,536
6Jul 3, 2026 18:509,53488,491,77573,805,0005,329,0002,113,536
7Jul 3, 2026 18:509,53488,605,95473,629,0005,507,0002,113,536
8Jul 3, 2026 18:509,54288,555,10474,001,0005,204,0002,113,536
9Jul 3, 2026 18:509,59388,989,54174,335,0005,294,0002,113,536