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 14:03sheryllynn24sheryllynn24Score: 15,705Success
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 14:0315,672157,044,921128,075,0002,001,0002,273,280
2Sep 18, 2025 14:0315,681157,282,555126,150,0004,004,0002,273,280
3Sep 18, 2025 14:0315,699160,776,667129,301,0001,002,0002,523,136
4Sep 18, 2025 14:0315,705153,501,261129,346,0001,002,0002,523,136
5Sep 18, 2025 14:0315,705154,247,032129,348,0001,002,0002,273,280
6Sep 18, 2025 14:0315,709154,548,955129,380,0001,002,0002,273,280
7Sep 18, 2025 14:0315,711154,221,907128,397,0002,006,0002,277,376
8Sep 18, 2025 14:0315,752161,776,756127,751,0002,994,0002,273,280
9Sep 18, 2025 14:0315,771160,777,532129,903,000999,0002,519,040