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 10, 2026 12:15Victor MerckléVictor MerckléScore: 13,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 12:1613,879122,724,632114,091,0001,107,0002,117,632stderr
2Jun 10, 2026 12:1613,919123,121,630114,483,0001,052,0002,117,632stderr
3Jun 10, 2026 12:1613,939123,228,398114,648,0001,046,0002,117,632stderr
4Jun 10, 2026 12:1613,946123,572,103114,685,0001,071,0002,117,632stderr
5Jun 10, 2026 12:1613,985123,572,964114,954,0001,125,0002,117,632stderr
6Jun 10, 2026 12:1614,000123,764,128115,087,0001,120,0002,117,632stderr
7Jun 10, 2026 12:1614,019123,924,201115,211,0001,150,0002,117,632stderr
8Jun 10, 2026 12:1614,035124,310,942115,356,0001,137,0002,117,632stderr
9Jun 10, 2026 12:1614,143125,352,097116,322,0001,066,0002,117,632stderr