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 listSep 27, 2025 06:50sheryllynn24sheryllynn24Score: 6,915Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 06:506,77181,343,25354,193,0002,007,0002,269,184
2Sep 27, 2025 06:506,79086,187,55754,347,0002,012,0002,289,664
3Sep 27, 2025 06:506,79679,425,97254,396,0002,014,0002,514,944
4Sep 27, 2025 06:506,91582,636,15556,388,0001,006,0002,519,040
5Sep 27, 2025 06:506,94581,469,89656,631,0001,011,0002,510,848
6Sep 27, 2025 06:506,94887,702,84057,670,00002,289,664