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 listJun 24, 2026 19:38Victor MerckléVictor MerckléScore: 4,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 19:394,51545,355,27336,392,0001,088,0002,117,632stderr
2Jun 24, 2026 19:394,51645,541,22936,376,0001,110,0002,117,632stderr
3Jun 24, 2026 19:394,51945,353,19536,407,0001,102,0002,117,632stderr
4Jun 24, 2026 19:394,52045,608,89736,434,0001,089,0002,117,632stderr
5Jun 24, 2026 19:394,52345,028,53136,437,0001,104,0002,117,632stderr
6Jun 24, 2026 19:394,53145,636,60736,492,0001,118,0002,117,632stderr
7Jun 24, 2026 19:394,72746,878,95938,139,0001,098,0002,117,632stderr
8Jun 24, 2026 19:394,74647,331,46838,387,0001,010,0002,117,632stderr
9Jun 24, 2026 19:394,77247,461,81038,586,0001,024,0002,117,632stderr