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 14:11Daniel MastalerzDaniel MastalerzScore: 5,683Success
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 14:125,60371,383,75544,480,0002,021,0002,326,528
2Feb 21, 2026 14:115,60471,190,21543,542,0002,968,0002,383,872
3Feb 21, 2026 14:115,60570,704,39944,499,0002,022,0002,523,136
4Feb 21, 2026 14:125,60873,797,49543,509,0003,035,0002,326,528
5Feb 21, 2026 14:115,60968,641,66542,509,0004,048,0002,265,088
6Feb 21, 2026 14:125,64274,178,66543,837,0002,988,0002,326,528
7Feb 21, 2026 14:125,68372,021,06943,154,0004,014,0002,318,336
8Feb 21, 2026 14:125,68669,214,90143,181,0004,016,0002,260,992
9Feb 21, 2026 14:115,70169,775,14344,295,0003,020,0002,318,336
10Feb 21, 2026 14:115,70668,174,77245,343,0002,015,0002,269,184
11Feb 21, 2026 14:125,71380,323,70943,383,0004,035,0002,318,336
12Feb 21, 2026 14:116,03973,837,17946,114,0004,009,0002,310,144