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 17:57Victor MerckléVictor MerckléScore: 4,221Success
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 17:584,20842,606,15433,793,0001,141,0002,113,536
2Jun 25, 2026 17:584,21342,502,31233,874,0001,098,0002,113,536
3Jun 25, 2026 17:584,21642,567,23533,908,0001,091,0002,113,536
4Jun 25, 2026 17:584,21942,602,47533,921,0001,097,0002,113,536
5Jun 25, 2026 17:584,22142,509,96533,972,0001,065,0002,113,536
6Jun 25, 2026 17:584,22242,603,19533,957,0001,088,0002,113,536
7Jun 25, 2026 17:584,23243,059,01334,030,0001,096,0002,113,536
8Jun 25, 2026 17:584,23344,095,79634,028,0001,109,0002,113,536
9Jun 25, 2026 17:584,29651,178,11834,522,0001,135,0002,113,536