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 10, 2026 04:44Josu San MartinJosu San MartinScore: 4,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 04:444,28556,959,84034,527,0001,041,0002,555,904
2May 10, 2026 04:444,28652,662,24834,545,0001,037,0002,551,808
3May 10, 2026 04:444,28953,908,75334,556,0001,046,0002,547,712
4May 10, 2026 04:444,29150,227,96534,596,0001,025,0002,560,000
5May 10, 2026 04:444,29352,804,18234,587,0001,052,0002,555,904
6May 10, 2026 04:444,29452,446,17434,612,0001,030,0002,551,808
7May 10, 2026 04:444,29853,765,26134,627,0001,047,0002,547,712
8May 10, 2026 04:444,31653,134,95034,781,0001,048,0002,547,712
9May 10, 2026 04:444,35952,156,04735,135,0001,051,0002,539,520