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 16:24Josu San MartinJosu San MartinScore: 65,567Success
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 16:1965,347570,779,595542,384,00002,363,392
2Dec 19, 2025 16:2465,460570,056,402543,318,00002,285,568
3Dec 19, 2025 16:1965,513569,368,485542,761,000999,0002,281,472
4Dec 19, 2025 16:1965,567570,366,073544,202,00002,285,568
5Dec 19, 2025 16:2465,567570,685,334543,206,0001,000,0002,461,696
6Dec 19, 2025 16:2465,610576,417,888544,562,00002,285,568