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 19:42Victor MerckléVictor MerckléScore: 25,202Success
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 19:4324,877214,413,683205,454,0001,031,0002,117,632stderr
2Jul 6, 2026 19:4325,137216,758,459207,585,0001,060,0002,117,632stderr
3Jul 6, 2026 19:4325,172218,212,629207,877,0001,052,0002,117,632stderr
4Jul 6, 2026 19:4325,194217,608,378208,076,0001,039,0002,117,632stderr
5Jul 6, 2026 19:4325,202217,183,218208,137,0001,041,0002,117,632stderr
6Jul 6, 2026 19:4325,204217,023,660208,163,0001,031,0002,117,632stderr
7Jul 6, 2026 19:4325,245217,417,024208,491,0001,048,0002,117,632stderr
8Jul 6, 2026 19:4325,300218,165,713208,881,0001,117,0002,117,632stderr
9Jul 6, 2026 19:4325,374218,448,626209,539,0001,067,0002,117,632stderr