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 listApr 10, 2026 15:35Danylo MocherniukDanylo MocherniukScore: 4,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 15:354,47070,618,39335,093,0002,005,0002,531,328
2Apr 10, 2026 15:354,47365,056,29834,120,0003,010,0002,297,856
3Apr 10, 2026 15:354,47662,306,67435,142,0002,008,0002,281,472
4Apr 10, 2026 15:354,49461,235,97334,278,0003,024,0002,289,664
5Apr 10, 2026 15:354,50661,407,80235,381,0002,021,0002,297,856
6Apr 10, 2026 15:354,51459,189,54136,451,0001,012,0002,404,352
7Apr 10, 2026 15:354,53165,158,21135,577,0002,033,0002,297,856
8Apr 10, 2026 15:354,55263,998,04334,799,0002,982,0002,297,856
9Apr 10, 2026 15:354,58666,517,42235,061,0003,005,0002,281,472
10Apr 10, 2026 15:354,63858,744,40736,469,0002,026,0002,285,568
11Apr 10, 2026 15:354,70161,930,22736,017,0003,001,0002,269,184
12Apr 10, 2026 15:354,70262,435,40938,028,0001,000,0002,281,472