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 29, 2026 09:11Victor MerckléVictor MerckléScore: 4,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 09:124,17642,518,37133,645,0001,016,0002,113,536
2Jun 29, 2026 09:124,18042,573,57233,638,0001,062,0002,113,536
3Jun 29, 2026 09:124,37644,232,16835,193,0001,132,0002,113,536
4Jun 29, 2026 09:124,39044,302,84835,401,0001,039,0002,113,536
5Jun 29, 2026 09:124,43144,684,92835,728,0001,055,0002,113,536
6Jun 29, 2026 09:124,49445,188,11136,213,0001,091,0002,113,536
7Jun 29, 2026 09:124,49645,215,49536,294,0001,024,0002,113,536
8Jun 29, 2026 09:124,56847,096,13036,893,0001,025,0002,113,536
9Jun 29, 2026 09:125,01649,491,78740,607,0001,030,0002,113,536