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 24, 2026 19:14Daniel MastalerzDaniel MastalerzScore: 12,113Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 19:1411,863123,028,81596,456,0002,009,0002,326,528
2Feb 24, 2026 19:1411,867131,303,59896,488,0002,010,0002,514,944
3Feb 24, 2026 19:1411,881128,372,91795,596,0003,018,0002,326,528
4Feb 24, 2026 19:1412,113127,444,88797,522,0003,016,0002,260,992
5Feb 24, 2026 19:1412,138131,190,60097,757,0002,992,0002,519,040
6Feb 24, 2026 19:1412,141133,678,05596,782,0003,991,0002,310,144