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 listJan 2, 2026 16:59Josu San MartinJosu San MartinScore: 6,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 16:595,76274,483,73245,831,0001,992,0002,281,472
2Jan 2, 2026 16:595,89173,795,39347,900,000997,0002,281,472
3Jan 2, 2026 16:595,89978,836,25546,963,0001,998,0002,281,472
4Jan 2, 2026 16:596,00578,222,51748,845,000996,0002,293,760
5Jan 2, 2026 16:596,03277,876,94149,061,0001,001,0002,486,272
6Jan 2, 2026 16:596,09578,157,49849,575,0001,011,0002,293,760