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 listOct 29, 2025 23:17Alexander KovalyovAlexander KovalyovScore: 43,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 23:1743,423381,919,907359,411,0001,001,0002,379,776
2Oct 29, 2025 23:1743,423383,498,534359,417,000998,0002,273,280
3Oct 29, 2025 23:1743,431386,791,782358,473,0002,002,0002,273,280
4Oct 29, 2025 23:1743,440387,921,944359,551,0001,001,0002,523,136
5Oct 29, 2025 23:1743,456385,674,298357,687,0002,997,0002,260,992
6Oct 29, 2025 23:1743,457392,205,527358,695,0001,998,0002,265,088
7Oct 29, 2025 23:1743,458382,756,198358,705,0001,998,0002,273,280
8Oct 29, 2025 23:1743,469386,600,076356,792,0003,997,0002,273,280
9Oct 29, 2025 23:1743,471385,740,455358,808,0001,998,0002,269,184