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 9, 2026 20:53Daniel MastalerzDaniel MastalerzScore: 9,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 20:539,467105,073,80876,562,0002,014,0002,506,752
2Feb 9, 2026 20:539,481111,888,76172,715,0005,976,0002,396,160
3Feb 9, 2026 20:539,486110,190,67173,750,0004,983,0002,338,816
4Feb 9, 2026 20:539,501102,295,74674,866,0003,992,0002,400,256
5Feb 9, 2026 20:539,526102,100,47774,063,0005,004,0002,506,752
6Feb 9, 2026 20:539,533102,810,10375,122,0004,006,0002,322,432
7Feb 9, 2026 20:539,535100,488,04074,129,0005,008,0002,314,240
8Feb 9, 2026 20:539,551108,331,58374,258,0005,017,0002,338,816
9Feb 9, 2026 20:539,559102,520,09574,317,0005,021,0002,314,240
10Feb 9, 2026 20:539,690103,685,78878,414,0002,010,0002,297,856
11Feb 9, 2026 20:539,693103,458,05074,417,0006,033,0002,314,240
12Feb 9, 2026 20:539,701103,336,38577,498,0003,019,0002,404,352