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 23, 2025 21:11alfaixalfaixScore: 64,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2025 21:1164,364563,171,710532,221,0002,000,0002,289,664
2Feb 23, 2025 21:1164,371559,120,215534,281,00002,281,472
3Feb 23, 2025 21:1164,377563,209,476533,332,0001,000,0002,277,376
4Feb 23, 2025 21:1164,380561,876,828533,355,0001,000,0002,277,376
5Feb 23, 2025 21:1164,380567,865,336533,350,0001,000,0002,277,376
6Feb 23, 2025 21:1164,389562,016,468534,429,00002,387,968
7Feb 23, 2025 21:1164,394561,905,146532,472,0001,998,0002,281,472
8Feb 23, 2025 21:1164,408570,466,208532,585,0001,998,0002,269,184
9Feb 23, 2025 21:1164,433558,861,934532,793,0001,999,0002,281,472