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 30, 2026 19:36boop34boop34Score: 34,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 19:3633,898291,206,764280,166,0001,195,0002,113,536
2Jul 30, 2026 19:3634,020292,473,266281,252,0001,118,0002,113,536
3Jul 30, 2026 19:3634,040292,427,554281,373,0001,164,0002,113,536
4Jul 30, 2026 19:3634,054292,550,578281,436,0001,213,0002,113,536
5Jul 30, 2026 19:3634,289294,492,726283,355,0001,247,0002,113,536
6Jul 30, 2026 19:3634,610297,459,524286,071,0001,195,0002,113,536
7Jul 30, 2026 19:3634,876299,961,434288,380,0001,099,0002,113,536
8Jul 30, 2026 19:3634,909299,857,471288,567,0001,178,0002,113,536
9Jul 30, 2026 19:3635,455304,233,338293,031,0001,250,0002,113,536