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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 18:205,51972,910,24543,817,0001,991,0002,310,144
2Feb 21, 2026 18:215,52267,583,49541,844,0003,985,0002,265,088
3Feb 21, 2026 18:215,53267,429,72442,921,0002,994,0002,322,432
4Feb 21, 2026 18:215,54072,205,41542,980,0002,998,0002,269,184
5Feb 21, 2026 18:205,54170,244,27141,990,0003,999,0002,265,088
6Feb 21, 2026 18:205,54973,301,52142,053,0004,005,0002,326,528
7Feb 21, 2026 18:215,57674,989,01243,259,0003,018,0002,260,992
8Feb 21, 2026 18:205,60271,147,65644,476,0002,021,0002,318,336
9Feb 21, 2026 18:215,60867,765,31843,512,0003,035,0002,306,048
10Feb 21, 2026 18:205,63976,005,92942,818,0003,983,0002,306,048
11Feb 21, 2026 18:205,64775,317,17742,883,0003,989,0002,265,088
12Feb 21, 2026 18:215,71371,969,69843,386,0004,035,0002,265,088