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 listDec 19, 2025 19:55idatsyidatsyScore: 38,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 19:5538,320341,066,731317,059,0001,000,0002,285,568
2Dec 19, 2025 19:5538,320340,725,914317,056,0001,000,0002,355,200
3Dec 19, 2025 19:5538,392342,545,946316,659,0001,997,0002,363,392
4Dec 19, 2025 19:5538,416356,118,164316,857,0001,999,0002,285,568
5Dec 19, 2025 19:5538,590344,596,636319,301,0001,000,0002,367,488
6Dec 19, 2025 19:5539,210349,414,318324,441,0001,001,0002,285,568
7Dec 19, 2025 19:5539,253360,711,903323,801,0001,998,0002,351,104
8Dec 19, 2025 19:5539,253349,225,242324,802,000999,0002,285,568
9Dec 19, 2025 19:5539,280350,778,829324,021,0002,000,0002,285,568