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 22:46Mikołaj UzarskiMikołaj UzarskiScore: 5,854Success
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 22:465,83873,677,50344,419,0004,038,0002,314,240
2Feb 19, 2026 22:465,84168,769,12543,428,0005,049,0002,293,760
3Feb 19, 2026 22:485,84573,616,14741,437,0007,074,0002,510,848
4Feb 19, 2026 22:465,85477,195,23844,539,0004,049,0002,469,888
5Feb 19, 2026 22:485,90973,916,43843,037,0006,005,0002,441,216
6Feb 19, 2026 22:485,98477,980,67744,700,0004,966,0002,486,272