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 14, 2026 23:25Andrew TsibinAndrew TsibinScore: 5,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 23:264,98550,961,90040,183,0001,200,0002,113,536
2Jul 14, 2026 23:264,99251,037,70540,418,0001,019,0002,113,536
3Jul 14, 2026 23:264,99551,036,42740,448,0001,016,0002,113,536
4Jul 14, 2026 23:265,00251,074,37740,511,0001,008,0002,113,536
5Jul 14, 2026 23:265,09351,848,02941,254,0001,024,0002,113,536
6Jul 14, 2026 23:265,10351,979,73941,251,0001,107,0002,113,536
7Jul 14, 2026 23:265,10751,947,86941,385,0001,006,0002,113,536
8Jul 14, 2026 23:265,14552,872,77941,695,0001,010,0002,113,536
9Jul 14, 2026 23:265,15954,037,83541,816,0001,011,0002,113,536