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 21, 2025 06:46sheryllynn24sheryllynn24Score: 9,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2025 06:469,065102,908,67074,234,0001,003,0002,289,664
2Sep 21, 2025 06:469,073102,516,31773,295,0002,008,0002,265,088
3Sep 21, 2025 06:469,154101,234,19474,983,000999,0002,519,040
4Sep 21, 2025 06:469,510108,371,37376,933,0001,998,0002,289,664
5Sep 21, 2025 06:469,514105,903,23276,970,0001,999,0002,367,488
6Sep 21, 2025 06:469,611103,841,65077,774,0001,994,0002,514,944