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 16:07Kevin HeaveyKevin HeaveyScore: 3,898Success
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 16:123,86741,687,03730,886,0001,218,0002,117,632
2Jul 12, 2026 16:123,87541,718,96831,149,0001,020,0002,117,632
3Jul 12, 2026 16:123,89441,921,48131,294,0001,027,0002,117,632
4Jul 12, 2026 16:123,89441,897,65531,305,0001,023,0002,117,632
5Jul 12, 2026 16:123,89841,890,90531,153,0001,201,0002,117,632
6Jul 12, 2026 16:123,99942,802,67731,979,0001,220,0002,117,632
7Jul 12, 2026 16:124,00642,796,29532,042,0001,208,0002,117,632
8Jul 12, 2026 16:124,02243,018,33932,358,0001,029,0002,117,632
9Jul 12, 2026 16:124,04843,172,40532,577,0001,022,0002,117,632