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 17, 2025 19:18sheryllynn24sheryllynn24Score: 21,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2025 19:1821,216205,682,922173,088,0003,001,0002,277,376
2Sep 17, 2025 19:1821,220200,543,598174,122,0002,001,0002,273,280
3Sep 17, 2025 19:1821,220203,137,690173,126,0003,002,0002,510,848
4Sep 17, 2025 19:1821,228204,016,600175,188,0001,001,0002,273,280
5Sep 17, 2025 19:1821,230198,584,362173,207,0003,003,0002,273,280
6Sep 17, 2025 19:1821,238200,469,050174,273,0002,003,0002,519,040
7Sep 17, 2025 19:1821,243202,671,267172,306,0004,007,0002,277,376
8Sep 17, 2025 19:1821,244203,002,494174,319,0002,003,0002,519,040
9Sep 17, 2025 19:1821,295212,485,504174,754,0001,997,0002,510,848