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 11, 2025 15:22Bernard TeoBernard TeoScore: 6,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:226,45275,464,82752,540,0001,010,0002,396,160
2Dec 11, 2025 15:226,45783,714,44553,591,00002,273,280
3Dec 11, 2025 15:226,46881,529,71353,682,00002,273,280
4Dec 11, 2025 15:226,48477,947,30051,828,0001,993,0002,273,280
5Dec 11, 2025 15:226,49276,324,83551,885,0001,995,0002,404,352
6Dec 11, 2025 15:226,51980,871,43252,106,0002,004,0002,273,280