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 20, 2025 08:53sheryllynn24sheryllynn24Score: 10,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 08:5310,241111,424,40883,999,000999,0002,519,040
2Sep 20, 2025 08:5310,252117,369,72583,089,0002,002,0002,359,296
3Sep 20, 2025 08:5310,252111,930,05283,091,0002,002,0002,260,992
4Sep 20, 2025 08:5310,285107,550,01184,359,0001,004,0002,506,752
5Sep 20, 2025 08:5310,289112,874,79883,386,0002,009,0002,269,184
6Sep 20, 2025 08:5310,467111,636,50885,879,000998,0002,519,040