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 8, 2026 11:46Victor MerckléVictor MerckléScore: 4,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 11:474,08542,019,83432,791,0001,121,0002,117,632stderr
2Jul 8, 2026 11:474,08542,032,13732,900,0001,011,0002,117,632stderr
3Jul 8, 2026 11:474,08842,005,51432,817,0001,118,0002,117,632stderr
4Jul 8, 2026 11:474,09842,162,07132,997,0001,018,0002,117,632stderr
5Jul 8, 2026 11:474,10443,577,50232,994,0001,074,0002,117,632stderr
6Jul 8, 2026 11:474,13442,401,07433,289,0001,031,0002,117,632stderr
7Jul 8, 2026 11:474,13442,476,42833,244,0001,075,0002,117,632stderr
8Jul 8, 2026 11:474,14842,579,61133,400,0001,032,0002,117,632stderr
9Jul 8, 2026 11:474,15242,633,92933,397,0001,066,0002,117,632stderr