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 21, 2025 06:14Rohan KapurRohan KapurScore: 72,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 06:1472,163620,973,923487,963,000110,991,0002,506,752
2Jan 21, 2025 06:1472,240624,578,487498,659,000100,931,0002,498,560
3Jan 21, 2025 06:1472,311630,620,161483,145,000117,035,0002,404,352