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 25, 2026 19:54Victor MerckléVictor MerckléScore: 12,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 19:5511,983107,618,48798,464,0001,003,0002,117,632stderr
2Jun 25, 2026 19:5512,041109,522,42898,834,0001,114,0002,117,632stderr
3Jun 25, 2026 19:5512,103108,163,63899,447,0001,008,0002,117,632stderr
4Jun 25, 2026 19:5512,132108,401,24299,563,0001,139,0002,117,632stderr
5Jun 25, 2026 19:5512,134108,442,26099,568,0001,151,0002,117,632stderr
6Jun 25, 2026 19:5512,154108,598,10899,866,0001,018,0002,117,632stderr
7Jun 25, 2026 19:5512,164108,617,05599,839,0001,126,0002,117,632stderr
8Jun 25, 2026 19:5512,169108,589,35599,889,0001,116,0002,117,632stderr
9Jun 25, 2026 19:5512,277109,544,635100,839,0001,062,0002,117,632stderr