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 20, 2026 18:18Daniel MastalerzDaniel MastalerzScore: 5,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 18:185,68870,103,28243,190,0004,017,0002,289,664
2Feb 20, 2026 18:175,72176,079,48343,441,0004,041,0002,314,240
3Feb 20, 2026 18:175,76874,835,66243,886,0003,989,0002,322,432
4Feb 20, 2026 18:185,81776,329,30444,259,0004,023,0002,277,376
5Feb 20, 2026 18:175,83175,395,37846,382,0002,016,0002,265,088
6Feb 20, 2026 18:175,85777,505,22146,584,0002,025,0002,269,184
7Feb 20, 2026 18:185,86074,003,78745,598,0003,039,0002,330,624
8Feb 20, 2026 18:185,90674,854,36346,021,0003,001,0002,310,144
9Feb 20, 2026 18:175,91573,221,37545,084,0004,007,0002,330,624
10Feb 20, 2026 18:175,94674,059,84445,326,0004,029,0002,306,048
11Feb 20, 2026 18:185,99972,612,01745,808,0003,983,0002,371,584
12Feb 20, 2026 18:186,02072,544,49047,968,0001,998,0002,318,336