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 23, 2026 21:09Daniel MastalerzDaniel MastalerzScore: 5,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 21:095,53672,900,78941,956,0003,995,0002,519,040
2Feb 23, 2026 21:095,54467,607,40943,012,0003,000,0002,322,432
3Feb 23, 2026 21:095,54970,925,28142,052,0004,005,0002,310,144
4Feb 23, 2026 21:095,61774,508,68943,579,0003,040,0002,314,240
5Feb 23, 2026 21:095,64171,645,27043,836,0002,988,0002,314,240
6Feb 23, 2026 21:095,66669,386,43043,025,0004,002,0002,273,280