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 28, 2025 02:45Josu San MartinJosu San MartinScore: 66,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 02:4566,859573,473,404552,928,0001,999,0002,478,080
2Dec 28, 2025 02:4566,863580,237,284552,962,0001,999,0002,473,984
3Dec 28, 2025 02:4566,863579,443,506552,962,0001,999,0002,277,376
4Dec 28, 2025 02:4566,864575,867,907552,971,0001,999,0002,539,520
5Dec 28, 2025 02:4566,880580,538,398554,100,0001,000,0002,539,520
6Dec 28, 2025 02:4566,917585,755,573553,414,0001,997,0002,539,520