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 10, 2026 14:38boop34boop34Score: 19,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 14:3819,429170,946,710157,292,0003,974,0002,129,920
2Jul 10, 2026 14:3819,433170,935,106158,311,0002,991,0002,129,920
3Jul 10, 2026 14:3819,435170,994,991156,359,0004,954,0002,129,920
4Jul 10, 2026 14:3819,458171,523,429157,527,0003,975,0002,129,920
5Jul 10, 2026 14:3819,459171,737,657156,581,0004,935,0002,129,920
6Jul 10, 2026 14:3819,483171,391,294159,679,0002,037,0002,129,920
7Jul 10, 2026 14:3819,503171,487,887158,887,0002,994,0002,129,920
8Jul 10, 2026 14:3819,507172,070,627157,934,0003,975,0002,129,920
9Jul 10, 2026 14:3819,725173,973,184160,734,0002,990,0002,129,920