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 2, 2026 12:21Victor MerckléVictor MerckléScore: 4,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:284,29743,364,62034,547,0001,122,0002,117,632stderr
2Jul 2, 2026 12:284,31743,555,18034,770,0001,063,0002,117,632stderr
3Jul 2, 2026 12:284,31743,526,98334,784,0001,049,0002,117,632stderr
4Jul 2, 2026 12:284,31743,616,70634,814,0001,021,0002,117,632stderr
5Jul 2, 2026 12:284,32243,610,12434,813,0001,064,0002,117,632stderr
6Jul 2, 2026 12:284,32643,676,65134,778,0001,128,0002,117,632stderr
7Jul 2, 2026 12:284,33443,709,24934,913,0001,067,0002,117,632stderr
8Jul 2, 2026 12:284,35644,107,76235,024,0001,132,0002,117,632stderr
9Jul 2, 2026 12:284,37450,970,07135,303,0001,008,0002,117,632stderr