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 15, 2026 01:11Kevin HeaveyKevin HeaveyScore: 3,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 01:123,69240,269,82329,609,0001,041,0002,117,632
2Jul 15, 2026 01:123,70540,324,44029,727,0001,030,0002,117,632
3Jul 15, 2026 01:123,70640,391,27329,736,0001,032,0002,117,632
4Jul 15, 2026 01:123,75840,790,37529,954,0001,238,0002,117,632
5Jul 15, 2026 01:123,77440,928,60930,278,0001,048,0002,117,632
6Jul 15, 2026 01:123,77941,028,60730,333,0001,039,0002,117,632
7Jul 15, 2026 01:123,78941,086,97430,409,0001,045,0002,117,632
8Jul 15, 2026 01:123,79541,106,27530,402,0001,103,0002,117,632
9Jul 15, 2026 01:123,81241,250,89030,598,0001,045,0002,117,632