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 13, 2026 21:12Daniel MastalerzDaniel MastalerzScore: 6,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 21:126,67080,281,78950,328,0005,032,0002,310,144
2Feb 13, 2026 21:126,67074,399,24051,335,0004,026,0002,338,816
3Feb 13, 2026 21:126,67780,594,70251,392,0004,030,0002,322,432
4Feb 13, 2026 21:126,67977,938,97450,396,0005,039,0002,318,336
5Feb 13, 2026 21:126,68484,731,06653,464,0002,017,0002,273,280
6Feb 13, 2026 21:126,68576,421,37652,462,0003,026,0002,342,912
7Feb 13, 2026 21:126,68881,330,27749,455,0006,055,0002,322,432
8Feb 13, 2026 21:126,69086,176,47050,481,0005,048,0002,289,664
9Feb 13, 2026 21:126,69988,058,98749,535,0006,065,0002,322,432
10Feb 13, 2026 21:126,81581,596,19852,525,0004,040,0002,265,088
11Feb 13, 2026 21:126,82681,041,31052,682,0003,976,0002,334,720
12Feb 13, 2026 21:126,84483,995,26553,817,0002,989,0002,322,432