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 7, 2026 11:01wnwnScore: 3,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 11:023,36843,796,20826,902,0001,059,0002,490,368
2May 7, 2026 11:023,37546,179,19626,962,0001,057,0002,486,272
3May 7, 2026 11:023,37741,753,86426,976,0001,056,0002,478,080
4May 7, 2026 11:023,38545,063,49227,030,0001,070,0002,482,176
5May 7, 2026 11:023,38643,634,40227,035,0001,072,0002,486,272
6May 7, 2026 11:023,38742,632,34227,040,0001,073,0002,482,176
7May 7, 2026 11:023,40943,668,69927,201,0001,101,0002,486,272
8May 7, 2026 11:023,41546,580,14127,282,0001,068,0002,494,464
9May 7, 2026 11:023,56245,310,98828,506,0001,066,0002,482,176