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 15, 2026 23:13wnwnScore: 8,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:137,18688,816,25852,568,0007,076,0002,301,952
2Feb 15, 2026 23:137,19988,445,83750,790,0008,963,0002,441,216
3Feb 15, 2026 23:137,21287,417,24449,884,0009,976,0002,424,832
4Feb 15, 2026 23:138,46593,497,56160,224,00010,037,0002,400,256
5Feb 15, 2026 23:138,55396,185,97060,992,0009,998,0002,269,184
6Feb 15, 2026 23:138,560100,032,97765,041,0006,003,0002,457,600