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 listJul 22, 2026 19:17Kevin HeaveyKevin HeaveyScore: 63,595Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 19:193,69240,440,23329,495,0001,156,0002,113,536
2Jul 22, 2026 19:193,69540,360,52729,516,0001,160,0002,113,536
3Jul 22, 2026 19:193,70340,401,26629,680,0001,055,0002,113,536
4Jul 22, 2026 19:193,72940,719,63829,674,0001,277,0002,113,536
5Jul 22, 2026 19:1963,595537,474,021526,639,0001,200,0002,113,536
6Jul 22, 2026 19:1963,597537,602,407526,615,0001,243,0002,113,536
7Jul 22, 2026 19:1964,168542,366,488531,598,0001,002,0002,113,536
8Jul 22, 2026 19:1964,186542,529,098531,749,0001,002,0002,113,536
9Jul 22, 2026 19:1964,482544,927,220534,199,0001,005,0002,113,536