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:08Victor MerckléVictor MerckléScore: 4,193Success
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:094,17242,133,25233,518,0001,113,0002,113,536
2Jun 25, 2026 00:094,18142,234,57933,585,0001,123,0002,113,536
3Jun 25, 2026 00:094,18442,308,13433,636,0001,092,0002,113,536
4Jun 25, 2026 00:094,18642,352,27833,631,0001,113,0002,113,536
5Jun 25, 2026 00:094,19342,411,04533,721,0001,081,0002,113,536
6Jun 25, 2026 00:094,20142,468,44633,760,0001,109,0002,113,536
7Jun 25, 2026 00:094,33143,543,09834,839,0001,116,0002,113,536
8Jun 25, 2026 00:094,38044,271,82235,259,0001,096,0002,113,536
9Jun 25, 2026 00:094,57545,944,99936,950,0001,028,0002,113,536