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,438Success
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,394558,572,830532,472,0001,998,0002,281,472
2Feb 23, 2025 21:1164,402560,248,321531,536,0002,997,0002,269,184
3Feb 23, 2025 21:1164,409560,481,052531,601,0002,997,0002,277,376
4Feb 23, 2025 21:1164,410559,846,735533,605,0001,001,0002,281,472
5Feb 23, 2025 21:1164,438559,581,577531,834,0002,999,0002,281,472
6Feb 23, 2025 21:1164,458558,330,560532,002,0003,000,0002,281,472
7Feb 23, 2025 21:1164,498572,227,482533,332,0002,001,0002,281,472
8Feb 23, 2025 21:1164,517568,623,352532,497,0002,997,0002,277,376
9Feb 23, 2025 21:1164,531564,094,121532,612,0002,997,0002,273,280