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 23, 2026 21:22Daniel MastalerzDaniel MastalerzScore: 5,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 21:225,57167,425,45344,232,0002,010,0002,510,848
2Feb 23, 2026 21:225,57268,950,65744,234,0002,010,0002,281,472
3Feb 23, 2026 21:225,58469,097,15743,328,0003,022,0002,285,568
4Feb 23, 2026 21:225,69169,891,43545,229,0002,010,0002,281,472
5Feb 23, 2026 21:225,69568,109,97045,260,0002,011,0002,498,560
6Feb 23, 2026 21:225,70970,654,88245,371,0002,016,0002,277,376