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 22, 2025 04:29Josu San MartinJosu San MartinScore: 45,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 03:3544,957399,648,620371,144,0002,000,0002,281,472
2Dec 22, 2025 03:3544,986400,951,069372,385,0001,001,0002,478,080
3Dec 22, 2025 04:2945,019405,582,416372,658,000999,0002,289,664
4Dec 22, 2025 04:2945,020404,276,328372,664,000999,0002,289,664
5Dec 22, 2025 03:3545,025397,913,120372,712,000999,0002,289,664
6Dec 22, 2025 04:2945,055396,473,210371,961,0001,999,0002,289,664