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 20, 2026 19:26Kevin HeaveyKevin HeaveyScore: 3,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 19:273,68040,185,00229,391,0001,158,0002,113,536
2Jul 20, 2026 19:273,69040,375,58929,462,0001,172,0002,113,536
3Jul 20, 2026 19:273,69240,243,01729,420,0001,229,0002,113,536
4Jul 20, 2026 19:273,71040,423,61329,647,0001,147,0002,113,536
5Jul 20, 2026 19:273,72540,584,51429,744,0001,176,0002,113,536
6Jul 20, 2026 19:273,73340,619,12029,838,0001,148,0002,113,536
7Jul 20, 2026 19:273,82541,484,61930,565,0001,188,0002,113,536
8Jul 20, 2026 19:273,86841,743,11430,950,0001,157,0002,113,536
9Jul 20, 2026 19:274,01942,988,83432,189,0001,171,0002,113,536