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 listSep 3, 2026 21:22Victor MerckléVictor MerckléScore: 4,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 21:224,64447,000,76237,492,0001,061,0002,117,632stderr
2Sep 3, 2026 21:224,64947,098,20137,518,0001,069,0002,117,632stderr
3Sep 3, 2026 21:224,73047,806,02738,123,0001,143,0002,117,632stderr
4Sep 3, 2026 21:224,74848,311,43138,350,0001,062,0002,117,632stderr
5Sep 3, 2026 21:224,76148,018,06838,446,0001,071,0002,117,632stderr
6Sep 3, 2026 21:224,77648,172,75738,572,0001,073,0002,117,632stderr
7Sep 3, 2026 21:224,82650,530,76238,918,0001,145,0002,117,632stderr
8Sep 3, 2026 21:224,82858,106,27739,060,0001,015,0002,121,728stderr
9Sep 3, 2026 21:224,87849,001,10039,350,0001,145,0002,117,632stderr