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 16, 2025 16:48sheryllynn24sheryllynn24Score: 37,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2025 16:4835,467322,403,113292,373,0002,002,0002,277,376
2Sep 16, 2025 16:4837,649342,024,507310,484,0002,003,0002,285,568
3Sep 16, 2025 16:4837,670340,251,348310,662,0001,997,0002,375,680
4Sep 16, 2025 16:4837,678336,847,782309,730,0002,997,0002,260,992
5Sep 16, 2025 16:4837,709342,568,550309,989,0002,999,0002,273,280
6Sep 16, 2025 16:4837,728336,872,692311,140,0002,000,0002,285,568
7Sep 16, 2025 16:4837,770340,453,643312,489,0001,001,0002,445,312
8Sep 16, 2025 16:4837,772340,629,060309,518,0003,993,0002,519,040
9Sep 16, 2025 16:4837,783342,215,636311,606,0001,997,0002,285,568