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 7, 2026 11:140xGlake0xGlakeScore: 87,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 11:1486,702729,232,527491,414,000228,220,0002,129,920
2Jul 7, 2026 11:1487,556736,800,538490,990,000235,727,0002,129,920
3Jul 7, 2026 11:1488,280742,417,359492,005,000240,724,0002,129,920