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 24, 2026 23:12Victor MerckléVictor MerckléScore: 4,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:134,48344,874,34536,098,0001,113,0002,113,536
2Jun 24, 2026 23:134,48644,874,32236,151,0001,091,0002,113,536
3Jun 24, 2026 23:134,52145,002,81336,513,0001,012,0002,113,536
4Jun 24, 2026 23:134,52145,144,48336,445,0001,081,0002,113,536
5Jun 24, 2026 23:134,56645,393,23336,785,0001,115,0002,113,536
6Jun 24, 2026 23:134,63546,159,72137,379,0001,093,0002,113,536
7Jun 24, 2026 23:134,63846,157,70437,412,0001,086,0002,113,536
8Jun 24, 2026 23:134,67546,305,49537,726,0001,077,0002,113,536
9Jun 24, 2026 23:134,68547,668,25937,777,0001,112,0002,113,536