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 12, 2026 01:20Kevin HeaveyKevin HeaveyScore: 48,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 01:2048,279410,301,931399,585,0001,137,0002,117,632
2Jul 12, 2026 01:2048,279410,416,084399,576,0001,146,0002,117,632
3Jul 12, 2026 01:2048,280410,374,526399,582,0001,148,0002,117,632
4Jul 12, 2026 01:2048,281410,385,859399,536,0001,200,0002,117,632
5Jul 12, 2026 01:2048,291410,481,685399,658,0001,163,0002,117,632
6Jul 12, 2026 01:2048,312410,618,291399,851,0001,141,0002,117,632
7Jul 12, 2026 01:2048,315410,690,783399,823,0001,197,0002,117,632
8Jul 12, 2026 01:2048,316410,679,931399,880,0001,145,0002,117,632
9Jul 12, 2026 01:2048,367411,033,656400,314,0001,134,0002,117,632