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 listFeb 17, 2026 18:56wnwnScore: 7,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 18:566,41876,175,30649,249,0004,020,0002,506,752
2Feb 17, 2026 18:566,42276,306,77250,284,0003,017,0002,486,272
3Feb 17, 2026 18:566,55279,846,28151,364,0003,021,0002,506,752
4Feb 17, 2026 18:567,42290,108,14859,580,0002,019,0002,514,944
5Feb 17, 2026 18:567,44786,149,66559,817,0001,993,0002,416,640
6Feb 17, 2026 18:567,52888,625,19060,464,0002,015,0002,445,312
7Feb 17, 2026 18:567,53891,793,43860,550,0002,018,0002,445,312
8Feb 17, 2026 18:567,55992,301,87359,754,0002,987,0002,437,120
9Feb 17, 2026 18:567,56388,480,17758,788,0003,985,0002,510,848
10Feb 17, 2026 18:567,56591,666,64459,800,0002,990,0002,387,968
11Feb 17, 2026 18:567,63987,929,60560,387,0003,019,0002,420,736
12Feb 17, 2026 18:567,69391,827,68959,861,0003,990,0002,445,312