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 listDec 19, 2025 16:33Josu San MartinJosu San MartinScore: 46,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 16:3346,102408,895,322380,645,0001,998,0002,355,200
2Dec 19, 2025 16:3346,102410,632,713380,649,0001,998,0002,285,568
3Dec 19, 2025 16:3346,102408,024,414381,644,000999,0002,355,200
4Dec 19, 2025 16:3346,125409,471,617380,838,0001,999,0002,363,392
5Dec 19, 2025 16:3346,135407,006,258381,921,000999,0002,359,296
6Dec 19, 2025 16:3346,139405,008,301380,958,0001,999,0002,285,568
7Dec 19, 2025 16:3346,147405,954,147382,016,0001,000,0002,285,568
8Dec 19, 2025 16:3346,157406,980,022383,101,00002,285,568
9Dec 19, 2025 16:3346,160410,366,131382,124,0001,000,0002,347,008