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:39olliecrowolliecrowScore: 6,336Success
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:395,91076,898,51946,053,0003,003,0002,289,664
2Feb 11, 2026 18:395,91274,283,97946,069,0003,004,0002,383,872
3Feb 11, 2026 18:395,95871,776,12146,428,0003,027,0002,437,120
4Feb 11, 2026 18:396,27784,190,22250,094,0002,003,0002,412,544
5Feb 11, 2026 18:396,29179,008,80348,202,0004,016,0002,338,816
6Feb 11, 2026 18:396,31283,537,11248,362,0004,030,0002,416,640
7Feb 11, 2026 18:396,33682,482,41449,558,0003,034,0002,375,680
8Feb 11, 2026 18:396,36181,261,34348,734,0004,061,0002,371,584
9Feb 11, 2026 18:396,39877,322,38747,093,0006,011,0002,338,816
10Feb 11, 2026 18:396,42382,347,62949,285,0004,023,0002,445,312
11Feb 11, 2026 18:396,45376,901,43151,537,0002,021,0002,420,736
12Feb 11, 2026 18:396,45977,455,74550,572,0003,034,0002,347,008