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 16, 2026 22:17Kevin HeaveyKevin HeaveyScore: 3,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 22:223,76341,069,14830,213,0001,023,0002,113,536
2Jul 16, 2026 22:223,76741,006,58730,242,0001,026,0002,113,536
3Jul 16, 2026 22:223,77841,111,51530,304,0001,054,0002,113,536
4Jul 16, 2026 22:223,77941,243,80630,347,0001,024,0002,113,536
5Jul 16, 2026 22:223,78841,792,90930,413,0001,029,0002,113,536
6Jul 16, 2026 22:223,80141,335,03430,526,0001,030,0002,113,536
7Jul 16, 2026 22:223,81341,456,75130,625,0001,027,0002,113,536
8Jul 16, 2026 22:223,82141,441,80730,693,0001,029,0002,113,536
9Jul 16, 2026 22:223,83441,607,06330,780,0001,043,0002,113,536