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 9, 2026 13:39wnwnScore: 3,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 13:393,36142,532,09726,876,0001,026,0002,482,176
2May 9, 2026 13:393,37345,165,77826,937,0001,062,0002,486,272
3May 9, 2026 13:393,38741,723,55327,049,0001,067,0002,490,368
4May 9, 2026 13:393,48443,384,06427,863,0001,062,0002,490,368
5May 9, 2026 13:393,48443,402,77527,803,0001,121,0002,478,080
6May 9, 2026 13:393,52943,552,36328,222,0001,072,0002,486,272
7May 9, 2026 13:393,54946,770,71528,398,0001,061,0002,490,368
8May 9, 2026 13:393,57148,376,14728,556,0001,086,0002,490,368
9May 9, 2026 13:393,57747,870,65828,618,0001,072,0002,490,368