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 19, 2026 19:34wnwnScore: 5,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 19:345,14067,971,19041,646,0001,015,0002,498,560
2Feb 19, 2026 19:345,14369,475,77541,698,000992,0002,527,232
3Feb 19, 2026 19:345,18770,326,51739,046,0004,004,0002,531,328
4Feb 19, 2026 19:345,19564,709,18942,113,0001,002,0002,531,328
5Feb 19, 2026 19:345,21566,217,23242,275,0001,006,0002,498,560
6Feb 19, 2026 19:345,28568,177,89342,867,000996,0002,486,272