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 18, 2025 13:33sheryllynn24sheryllynn24Score: 15,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2025 13:3315,876157,999,106129,772,0001,996,0002,277,376
2Sep 18, 2025 13:3315,905158,367,968129,012,0003,000,0002,510,848
3Sep 18, 2025 13:3315,922161,517,874129,152,0003,003,0002,277,376
4Sep 18, 2025 13:3315,936161,256,086130,268,0002,004,0002,519,040
5Sep 18, 2025 13:3315,939152,499,980130,293,0002,004,0002,273,280
6Sep 18, 2025 13:3316,000159,274,442130,804,0001,997,0002,347,008
7Sep 18, 2025 13:3316,002164,392,978129,825,0002,995,0002,523,136
8Sep 18, 2025 13:3316,335159,212,891134,578,0001,004,0002,506,752
9Sep 18, 2025 13:3316,455160,761,316134,585,0001,993,0002,277,376