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 listFeb 18, 2026 03:21Daniel MastalerzDaniel MastalerzScore: 7,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 03:216,79877,751,95549,371,0007,053,0002,371,584
2Feb 18, 2026 03:216,84379,834,47445,836,00010,960,0002,375,680
3Feb 18, 2026 03:216,85679,942,69845,926,00010,982,0002,383,872
4Feb 18, 2026 03:217,05185,707,49451,458,0007,062,0002,502,656
5Feb 18, 2026 03:217,22485,653,43349,969,0009,993,0002,469,888
6Feb 18, 2026 03:217,25287,954,38951,162,0009,028,0002,338,816