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 18:10sheryllynn24sheryllynn24Score: 33,472Success
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 18:1032,116296,654,720263,557,0003,006,0002,359,296
2Sep 16, 2025 18:1032,376296,285,198266,720,0001,997,0002,277,376
3Sep 16, 2025 18:1032,379302,186,706264,750,0003,996,0002,277,376
4Sep 16, 2025 18:1032,383290,162,962267,780,0001,002,0002,289,664
5Sep 16, 2025 18:1033,472302,589,978276,821,000999,0002,510,848
6Sep 16, 2025 18:1033,479307,574,308275,878,0001,999,0002,277,376
7Sep 16, 2025 18:1033,489306,169,863274,962,0002,999,0002,277,376
8Sep 16, 2025 18:1033,491304,555,316275,976,0001,999,0002,269,184
9Sep 16, 2025 18:1033,499306,128,711275,038,0003,000,0002,277,376