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 listFeb 21, 2026 10:35Daniel MastalerzDaniel MastalerzScore: 6,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 10:356,00677,830,14546,858,0002,990,0002,523,136
2Feb 21, 2026 10:356,00677,382,98445,863,0003,988,0002,265,088
3Feb 21, 2026 10:356,01672,355,27145,938,0003,994,0002,326,528
4Feb 21, 2026 10:356,11980,642,96347,797,0002,987,0002,269,184
5Feb 21, 2026 10:356,12079,680,36047,811,0002,988,0002,318,336
6Feb 21, 2026 10:356,12475,050,35747,840,0002,990,0002,301,952