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 listJul 10, 2026 08:54wnwnScore: 3,371Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 08:553,29235,347,01626,308,0001,017,0002,113,536
2Jul 10, 2026 08:553,30135,299,02726,372,0001,031,0002,113,536
3Jul 10, 2026 08:553,30635,481,94826,407,0001,041,0002,113,536
4Jul 10, 2026 08:553,33335,575,50426,639,0001,030,0002,113,536
5Jul 10, 2026 08:553,37135,847,23826,944,0001,042,0002,113,536
6Jul 10, 2026 08:553,43736,408,52027,516,0001,012,0002,113,536
7Jul 10, 2026 08:553,44836,728,23527,605,0001,021,0002,113,536
8Jul 10, 2026 08:553,48637,285,99327,919,0001,016,0002,113,536
9Jul 10, 2026 08:553,49837,072,86228,001,0001,033,0002,113,536