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 1, 2025 21:20E SequeiraE SequeiraScore: 118,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 21:20118,1121,014,972,047916,371,00063,956,0002,359,296
2Feb 1, 2025 21:20118,1971,005,437,736916,033,00065,002,0002,322,432
3Feb 1, 2025 21:20118,5551,006,378,150930,004,00054,000,0002,326,528