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 15, 2025 13:14AndreiAndreiScore: 73,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 13:1473,662639,487,534555,362,00056,036,0002,510,848
2Dec 15, 2025 13:1473,743636,286,548569,061,00043,004,0002,519,040
3Dec 15, 2025 13:1473,809645,086,486555,650,00056,964,0002,510,848
4Dec 15, 2025 13:1473,909643,701,032560,491,00052,951,0002,543,616
5Dec 15, 2025 13:1473,991643,107,774561,112,00053,010,0002,289,664
6Dec 15, 2025 13:1473,994639,803,458563,142,00051,012,0002,523,136
7Dec 15, 2025 13:1474,006639,284,663572,230,00042,016,0002,293,760
8Dec 15, 2025 13:1474,082647,199,462563,892,00050,990,0002,547,712
9Dec 15, 2025 13:1474,194649,173,401551,830,00063,980,0002,543,616