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 listMay 9, 2026 12:24wnwnScore: 3,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 12:243,37241,999,50126,937,0001,055,0002,490,368
2May 9, 2026 12:243,38943,680,24827,079,0001,052,0002,486,272
3May 9, 2026 12:243,38945,378,89827,080,0001,055,0002,482,176
4May 9, 2026 12:243,41942,875,83327,231,0001,150,0002,486,272
5May 9, 2026 12:243,43144,049,88327,408,0001,074,0002,486,272
6May 9, 2026 12:243,56245,070,20428,438,0001,127,0002,490,368
7May 9, 2026 12:243,56546,302,88428,504,0001,089,0002,482,176
8May 9, 2026 12:243,58544,112,06128,666,0001,091,0002,486,272
9May 9, 2026 12:243,59747,489,96028,755,0001,102,0002,486,272