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 00:34Victor MerckléVictor MerckléScore: 4,212Success
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 00:354,16842,084,94133,496,0001,105,0002,113,536
2Jun 25, 2026 00:354,19642,329,21133,824,0001,008,0002,113,536
3Jun 25, 2026 00:354,20042,413,67233,753,0001,108,0002,113,536
4Jun 25, 2026 00:354,20242,483,01233,783,0001,097,0002,113,536
5Jun 25, 2026 00:354,21242,534,99733,876,0001,086,0002,113,536
6Jun 25, 2026 00:354,27843,105,74534,423,0001,087,0002,113,536
7Jun 25, 2026 00:354,29643,236,79934,585,0001,076,0002,113,536
8Jun 25, 2026 00:354,30943,256,23134,671,0001,094,0002,113,536
9Jun 25, 2026 00:354,33043,512,90034,894,0001,049,0002,113,536