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 15:47AndreiAndreiScore: 51,215Success
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 15:4751,189450,404,934423,873,000999,0002,539,520
2Dec 15, 2025 15:4751,197449,847,182422,938,0001,999,0002,531,328
3Dec 15, 2025 15:4751,201455,069,554424,969,00002,535,424
4Dec 15, 2025 15:4751,214456,839,471423,073,0002,000,0002,539,520
5Dec 15, 2025 15:4751,215453,645,328423,085,0002,000,0002,449,408
6Dec 15, 2025 15:4751,219451,080,757422,120,0003,000,0002,543,616
7Dec 15, 2025 15:4751,235451,755,310423,246,0002,001,0002,539,520
8Dec 15, 2025 15:4751,242454,436,779423,311,0002,001,0002,555,904
9Dec 15, 2025 15:4752,208460,692,501430,324,0003,002,0002,293,760