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 listAug 5, 2026 22:22TonyTonyScore: 8,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 22:228,81482,927,13670,667,0002,494,0002,113,536
2Aug 5, 2026 22:228,82983,048,63670,603,0002,679,0002,113,536
3Aug 5, 2026 22:228,86784,127,30970,923,0002,675,0002,113,536
4Aug 5, 2026 22:228,91183,772,01571,327,0002,642,0002,113,536
5Aug 5, 2026 22:228,91483,751,99271,346,0002,648,0002,113,536
6Aug 5, 2026 22:228,92083,892,05471,326,0002,710,0002,113,536
7Aug 5, 2026 22:228,93083,958,50871,474,0002,646,0002,113,536
8Aug 5, 2026 22:228,94884,145,25871,557,0002,719,0002,113,536
9Aug 5, 2026 22:228,96784,293,60471,772,0002,655,0002,113,536