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 10, 2026 06:40Josu San MartinJosu San MartinScore: 4,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 06:414,11452,430,62932,987,0001,163,0002,473,984
2May 10, 2026 06:414,11751,885,42133,040,0001,135,0002,486,272
3May 10, 2026 06:414,13552,533,82933,257,0001,071,0002,482,176
4May 10, 2026 06:414,14452,752,60533,346,0001,057,0002,486,272
5May 10, 2026 06:414,16250,499,44933,484,0001,066,0002,478,080
6May 10, 2026 06:414,16246,862,86133,488,0001,057,0002,473,984
7May 10, 2026 06:414,17550,950,03833,571,0001,082,0002,486,272
8May 10, 2026 06:414,17751,062,18033,572,0001,099,0002,482,176
9May 10, 2026 06:414,18249,908,32533,656,0001,058,0002,478,080