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 listAug 22, 2025 22:16Gjorgji KjosevGjorgji KjosevScore: 58,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 22:1658,517517,759,375483,694,0001,998,0002,367,488
2Aug 22, 2025 22:1658,520516,104,798483,719,0001,998,0002,281,472
3Aug 22, 2025 22:1658,542507,764,238483,902,0001,999,0002,285,568
4Aug 22, 2025 22:1658,546508,366,172483,929,0001,999,0002,285,568
5Aug 22, 2025 22:1658,568516,294,503485,118,0001,000,0002,285,568
6Aug 22, 2025 22:1658,573513,685,184486,153,00002,367,488
7Aug 22, 2025 22:1658,633516,740,994484,659,0001,998,0002,363,392
8Aug 22, 2025 22:1658,670510,621,735484,959,0001,999,0002,363,392
9Aug 22, 2025 22:1658,693513,370,024486,156,0001,000,0002,363,392