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 17, 2025 22:39Leon ZhaoLeon ZhaoScore: 11,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2025 22:3911,212122,212,18391,055,0002,001,0002,465,792
2Dec 17, 2025 22:3911,213120,581,48092,071,0001,000,0002,285,568
3Dec 17, 2025 22:3911,223116,576,75991,148,0002,003,0002,314,240
4Dec 17, 2025 22:3911,637121,243,34695,578,0001,006,0002,465,792
5Dec 17, 2025 22:3911,641121,551,40895,614,0001,006,0002,285,568
6Dec 17, 2025 22:3911,664127,475,59194,817,0001,996,0002,457,600