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 18, 2026 10:03wnwnScore: 7,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:036,20075,999,57547,427,0004,036,0002,519,040
2Feb 18, 2026 10:036,30575,422,73149,310,0003,019,0002,355,200
3Feb 18, 2026 10:036,33783,694,91549,561,0003,034,0002,416,640
4Feb 18, 2026 10:037,12780,808,66657,147,0002,005,0002,482,176
5Feb 18, 2026 10:037,16679,113,15355,444,0004,032,0002,347,008
6Feb 18, 2026 10:037,24279,172,90957,102,0003,005,0002,404,352
7Feb 18, 2026 10:037,25987,027,50555,231,0005,021,0002,514,944
8Feb 18, 2026 10:037,26682,975,55657,295,0003,015,0002,490,368
9Feb 18, 2026 10:037,30686,964,15056,661,0003,976,0002,318,336
10Feb 18, 2026 10:037,34081,649,13857,925,0002,996,0002,273,280
11Feb 18, 2026 10:037,38384,164,21957,263,0004,018,0002,420,736
12Feb 18, 2026 10:037,49882,789,21659,226,0003,011,0002,301,952