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 listMar 15, 2026 07:57eldon-chungeldon-chungScore: 37,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 07:5636,884334,322,254304,139,0002,000,0002,285,568
2Mar 15, 2026 07:5736,888332,628,536304,170,0002,001,0002,277,376
3Mar 15, 2026 07:5636,890328,358,604305,188,0001,000,0002,285,568
4Mar 15, 2026 07:5636,896330,010,255305,236,0001,000,0002,285,568
5Mar 15, 2026 07:5736,903329,801,297305,292,0001,000,0002,285,568
6Mar 15, 2026 07:5737,402336,268,520310,435,00002,285,568
7Mar 15, 2026 07:5737,404340,104,804309,451,0001,001,0002,527,232
8Mar 15, 2026 07:5737,415335,724,872310,542,00002,285,568
9Mar 15, 2026 07:5737,417333,693,303308,560,0001,997,0002,285,568
10Mar 15, 2026 07:5737,430340,234,611308,676,0001,997,0002,285,568
11Mar 15, 2026 07:5737,438333,925,882308,739,0001,998,0002,273,280
12Mar 15, 2026 07:5737,443339,477,210308,778,0001,998,0002,260,992