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 10, 2025 22:14NeoNeoScore: 34,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2025 22:1434,239305,698,161282,180,0002,001,0002,281,472
2Feb 10, 2025 22:1434,245305,242,150283,237,0001,000,0002,289,664
3Feb 10, 2025 22:1434,273311,193,579283,465,0001,001,0002,289,664