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 16, 2026 08:00wnwnScore: 3,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 08:013,70538,693,52929,732,0001,022,0002,113,536
2Jul 16, 2026 08:013,70738,929,83029,769,0001,002,0002,113,536
3Jul 16, 2026 08:013,71138,726,94529,797,0001,005,0002,113,536
4Jul 16, 2026 08:013,71838,789,69829,826,0001,034,0002,113,536
5Jul 16, 2026 08:013,71939,006,30229,863,0001,006,0002,113,536
6Jul 16, 2026 08:013,72439,083,99829,866,0001,048,0002,113,536
7Jul 16, 2026 08:013,72638,863,74929,905,0001,023,0002,113,536
8Jul 16, 2026 08:013,74339,062,90830,000,0001,075,0002,113,536
9Jul 16, 2026 08:013,76439,280,80730,216,0001,030,0002,113,536