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 17, 2026 22:22Daniel MastalerzDaniel MastalerzScore: 6,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 22:216,53775,467,81751,245,0003,014,0002,412,544
2Feb 17, 2026 22:226,53874,978,42551,250,0003,014,0002,297,856
3Feb 17, 2026 22:216,54780,685,67553,334,0001,006,0002,490,368
4Feb 17, 2026 22:216,54780,396,20152,330,0002,012,0002,416,640
5Feb 17, 2026 22:226,55081,231,20452,355,0002,013,0002,297,856
6Feb 17, 2026 22:226,64879,904,80452,172,0003,009,0002,424,832
7Feb 17, 2026 22:226,66678,053,52353,318,0002,012,0002,289,664
8Feb 17, 2026 22:216,66780,109,74653,328,0002,012,0002,412,544
9Feb 17, 2026 22:216,69184,750,24253,518,0002,019,0002,412,544
10Feb 17, 2026 22:226,78285,791,95653,276,0003,015,0002,416,640
11Feb 17, 2026 22:226,84885,513,38654,806,0002,029,0002,416,640
12Feb 17, 2026 22:216,86578,606,77753,979,0002,998,0002,289,664