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 6, 2026 21:30Victor MerckléVictor MerckléScore: 5,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:355,56154,176,76645,030,0001,127,0002,117,632stderr
2Jul 6, 2026 21:355,56454,255,23345,033,0001,154,0002,117,632stderr
3Jul 6, 2026 21:355,56554,243,70144,995,0001,197,0002,117,632stderr
4Jul 6, 2026 21:355,56854,298,63145,031,0001,189,0002,117,632stderr
5Jul 6, 2026 21:355,57554,796,23245,091,0001,185,0002,117,632stderr
6Jul 6, 2026 21:355,57554,340,75345,158,0001,119,0002,117,632stderr
7Jul 6, 2026 21:355,58154,987,58145,306,0001,017,0002,117,632stderr
8Jul 6, 2026 21:355,58654,925,07945,351,0001,020,0002,117,632stderr
9Jul 6, 2026 21:355,59354,954,42745,403,0001,024,0002,117,632stderr