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 18:41idatsyidatsyScore: 44,475Success
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 18:4144,456397,817,436366,989,0001,999,0002,285,568
2Dec 19, 2025 18:4144,469392,867,518368,089,0001,000,0002,285,568
3Dec 19, 2025 18:4144,472398,594,905368,116,0001,000,0002,363,392
4Dec 19, 2025 18:4144,473392,319,769369,130,00002,285,568
5Dec 19, 2025 18:4144,475392,473,942369,144,00002,494,464
6Dec 19, 2025 18:4144,478389,200,613368,167,0001,000,0002,281,472
7Dec 19, 2025 18:4144,478393,197,124368,165,0001,000,0002,285,568
8Dec 19, 2025 18:4144,535395,810,246368,641,000999,0002,359,296
9Dec 19, 2025 18:4144,987404,218,025372,392,0001,001,0002,285,568