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 listAug 17, 2026 23:55flavio87flavio87Score: 3,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 23:573,66738,786,82229,427,0001,010,0002,113,536
2Aug 17, 2026 23:573,73939,337,03129,996,0001,040,0002,113,536
3Aug 17, 2026 23:573,76739,402,98330,212,0001,062,0002,113,536
4Aug 17, 2026 23:573,77640,470,14030,262,0001,080,0002,113,536
5Aug 17, 2026 23:573,78639,976,41030,389,0001,039,0002,113,536
6Aug 17, 2026 23:573,79939,907,01630,471,0001,068,0002,113,536
7Aug 17, 2026 23:573,80140,834,13230,482,0001,071,0002,113,536
8Aug 17, 2026 23:573,80940,197,58830,543,0001,079,0002,113,536
9Aug 17, 2026 23:573,82040,042,84430,625,0001,083,0002,113,536