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 08:00sheryllynn24sheryllynn24Score: 8,537Success
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 08:008,05092,962,44664,819,0001,994,0002,289,664
2Sep 21, 2025 08:008,12493,762,16266,422,0001,006,0002,510,848
3Sep 21, 2025 08:008,14494,179,41866,584,0001,008,0002,363,392
4Sep 21, 2025 08:008,537100,421,32068,862,0001,996,0002,289,664
5Sep 21, 2025 08:008,56398,494,95468,068,0003,003,0002,289,664
6Sep 21, 2025 08:008,56598,647,24970,087,0001,001,0002,289,664