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 listJan 11, 2025 17:18Ian MckibbenIan MckibbenScore: 51,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 17:2044,155393,593,838365,482,0001,001,0002,289,664
2Jan 11, 2025 17:2044,163390,576,121365,557,000998,0002,273,280
3Jan 11, 2025 17:2044,175387,864,505365,650,000999,0002,289,664
4Jan 11, 2025 17:1851,292452,399,266424,722,000999,0002,273,280
5Jan 11, 2025 17:1851,440451,799,749424,957,0001,999,0002,289,664
6Jan 11, 2025 17:1851,564456,594,740427,981,00002,277,376