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 05:00Josu San MartinJosu San MartinScore: 4,262Success
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 05:014,23852,291,47334,064,0001,119,0002,494,464
2May 10, 2026 05:014,24950,893,37734,221,0001,049,0002,490,368
3May 10, 2026 05:014,25150,680,23234,106,0001,180,0002,486,272
4May 10, 2026 05:014,26049,929,57934,322,0001,044,0002,486,272
5May 10, 2026 05:014,26251,474,66434,316,0001,066,0002,478,080
6May 10, 2026 05:014,26249,830,82734,198,0001,181,0002,490,368
7May 10, 2026 05:014,26552,272,47434,347,0001,056,0002,490,368
8May 10, 2026 05:014,26651,421,52134,359,0001,050,0002,478,080
9May 10, 2026 05:014,27650,661,53334,402,0001,096,0002,482,176