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 7, 2026 11:53Kevin HeaveyKevin HeaveyScore: 4,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 11:554,33745,602,80634,821,0001,177,0002,117,632
2Jul 7, 2026 11:554,34145,545,38534,891,0001,143,0002,117,632
3Jul 7, 2026 11:554,40846,190,65435,404,0001,188,0002,117,632
4Jul 7, 2026 11:554,41346,195,59835,447,0001,184,0002,117,632
5Jul 7, 2026 11:554,41446,235,68235,464,0001,178,0002,117,632
6Jul 7, 2026 11:554,42546,250,82135,540,0001,189,0002,117,632
7Jul 7, 2026 11:554,45346,475,29635,936,0001,031,0002,117,632
8Jul 7, 2026 11:554,64248,136,21737,338,0001,191,0002,117,632
9Jul 7, 2026 11:554,70248,736,84337,849,0001,182,0002,117,632