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 30, 2026 10:22Victor MerckléVictor MerckléScore: 21,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:2521,730188,091,908179,212,0001,151,0002,117,632stderr
2Jun 30, 2026 10:2521,748188,406,282179,355,0001,160,0002,117,632stderr
3Jun 30, 2026 10:2521,856189,169,588180,299,0001,108,0002,117,632stderr
4Jun 30, 2026 10:2521,860189,276,348180,386,0001,055,0002,117,632stderr
5Jun 30, 2026 10:2521,860189,140,113180,363,0001,079,0002,117,632stderr
6Jun 30, 2026 10:2521,882189,494,949180,556,0001,072,0002,117,632stderr
7Jun 30, 2026 10:2521,941189,997,501181,087,0001,024,0002,117,632stderr
8Jun 30, 2026 10:2521,963190,108,155181,261,0001,035,0002,117,632stderr
9Jun 30, 2026 10:2521,997190,300,016181,496,0001,087,0002,117,632stderr