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:27Bernard TeoBernard TeoScore: 6,083Success
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:276,07779,244,85249,434,0001,008,0002,392,064
2Dec 11, 2025 15:276,08074,955,55650,465,00002,392,064
3Dec 11, 2025 15:276,08276,588,69450,480,00002,273,280
4Dec 11, 2025 15:276,08377,114,15950,489,00002,273,280
5Dec 11, 2025 15:276,10076,270,27749,638,000992,0002,506,752
6Dec 11, 2025 15:276,10776,728,77749,672,0001,013,0002,273,280