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 14:07Kevin HeaveyKevin HeaveyScore: 4,073Success
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 14:084,06343,358,48832,484,0001,241,0002,117,632
2Jul 12, 2026 14:084,06543,320,67432,513,0001,230,0002,117,632
3Jul 12, 2026 14:084,06543,495,61432,517,0001,229,0002,117,632
4Jul 12, 2026 14:084,06743,406,57832,724,0001,039,0002,117,632
5Jul 12, 2026 14:084,07343,348,32532,768,0001,039,0002,117,632
6Jul 12, 2026 14:084,08043,575,29032,826,0001,040,0002,117,632
7Jul 12, 2026 14:084,08243,495,96732,673,0001,211,0002,117,632
8Jul 12, 2026 14:084,10043,693,42432,990,0001,045,0002,117,632
9Jul 12, 2026 14:084,17744,342,85933,428,0001,242,0002,117,632