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 12:17wnwnScore: 3,562Success
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 12:173,44444,103,94927,526,0001,064,0002,490,368
2May 9, 2026 12:173,44843,108,24027,530,0001,092,0002,482,176
3May 9, 2026 12:173,55246,138,75428,407,0001,081,0002,486,272
4May 9, 2026 12:173,56246,222,17428,498,0001,074,0002,486,272
5May 9, 2026 12:173,56246,844,36628,475,0001,093,0002,473,984
6May 9, 2026 12:173,56445,193,52028,505,0001,081,0002,494,464
7May 9, 2026 12:173,56547,686,18428,510,0001,081,0002,490,368
8May 9, 2026 12:173,56545,113,12928,507,0001,086,0002,494,464
9May 9, 2026 12:173,57445,877,27628,596,0001,073,0002,486,272