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 listMay 19, 2026 14:24Victor MerckléVictor MerckléScore: 6,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:245,85857,100,97847,605,0001,019,0002,113,536
2May 19, 2026 14:245,86557,780,68147,675,0001,012,0002,113,536
3May 19, 2026 14:245,86658,899,65347,664,0001,027,0002,113,536
4May 19, 2026 14:246,03659,556,15949,074,0001,028,0002,113,536
5May 19, 2026 14:246,03959,897,43549,095,0001,031,0002,113,536
6May 19, 2026 14:246,05961,599,18249,262,0001,028,0002,113,536
7May 19, 2026 14:246,06761,315,31149,335,0001,027,0002,113,536
8May 19, 2026 14:246,07560,717,78949,393,0001,037,0002,113,536
9May 19, 2026 14:246,09660,238,16249,545,0001,058,0002,113,536