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 28, 2025 15:34David-AntunesDavid-AntunesScore: 390,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 15:34387,1503,242,581,4883,157,378,00055,971,0002,363,392
2Jan 28, 2025 15:34390,8423,273,000,8863,187,027,00056,964,0002,490,368
3Jan 28, 2025 15:34396,5453,315,544,9003,218,362,00072,962,0002,281,472