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 25, 2025 11:53Daniel MastalerzDaniel MastalerzScore: 68,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 11:5368,261591,789,816564,565,0001,998,0002,273,280
2Sep 25, 2025 11:5368,317595,669,242566,032,0001,000,0002,396,160
3Sep 25, 2025 11:5368,340595,650,348567,220,00002,273,280
4Sep 25, 2025 11:5368,345596,558,991565,268,0001,997,0002,400,256
5Sep 25, 2025 11:5368,347604,466,375567,283,00002,400,256
6Sep 25, 2025 11:5368,351600,585,780566,316,0001,000,0002,408,448
7Sep 25, 2025 11:5368,373600,459,777566,498,000999,0002,273,280
8Sep 25, 2025 11:5368,377596,300,189565,532,0001,998,0002,273,280
9Sep 25, 2025 11:5368,378590,858,920566,540,000999,0002,396,160