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 3, 2026 12:48limanjun99limanjun99Score: 5,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 12:505,47661,999,74843,240,0002,212,0002,510,848
2May 3, 2026 12:505,49262,028,41043,396,0002,189,0002,510,848
3May 3, 2026 12:505,51361,365,62643,439,0002,323,0002,502,656
4May 3, 2026 12:505,52261,694,26543,512,0002,322,0002,502,656
5May 3, 2026 12:505,52462,764,67542,653,0003,201,0002,506,752
6May 3, 2026 12:505,52563,442,99442,604,0003,255,0002,510,848
7May 3, 2026 12:505,52565,629,86443,646,0002,216,0002,514,944
8May 3, 2026 12:505,66065,539,34143,755,0003,228,0002,494,464
9May 3, 2026 12:505,67162,319,33444,840,0002,237,0002,506,752