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 23, 2025 07:27Ian MckibbenIan MckibbenScore: 258,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 07:27258,0952,174,244,1152,142,189,00002,531,328
2Jan 23, 2025 07:27258,1432,163,934,1522,141,589,000999,0002,531,328
3Jan 23, 2025 07:27258,1962,169,624,6662,141,024,0001,999,0002,269,184