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 11, 2026 18:19olliecrowolliecrowScore: 6,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:195,89377,226,50346,920,0001,996,0002,334,720
2Feb 11, 2026 18:195,89774,840,31544,946,0003,995,0002,318,336
3Feb 11, 2026 18:195,90084,710,40846,972,0001,998,0002,306,048
4Feb 11, 2026 18:196,26283,014,09348,973,0002,998,0002,482,176
5Feb 11, 2026 18:196,31879,008,77348,403,0004,033,0002,486,272
6Feb 11, 2026 18:196,33777,647,24849,559,0003,034,0002,326,528
7Feb 11, 2026 18:196,34379,639,52948,594,0004,049,0002,289,664
8Feb 11, 2026 18:196,34779,932,80847,613,0005,065,0002,277,376
9Feb 11, 2026 18:196,40580,612,01750,150,0003,009,0002,355,200
10Feb 11, 2026 18:196,48282,083,18048,820,0004,981,0002,396,160
11Feb 11, 2026 18:196,49777,958,50249,930,0003,994,0002,367,488
12Feb 11, 2026 18:196,52680,374,50351,155,0003,009,0002,334,720