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 listSep 20, 2025 08:33sheryllynn24sheryllynn24Score: 10,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 08:3310,565116,291,79686,686,0001,007,0002,281,472
2Sep 20, 2025 08:3310,579111,949,36886,808,000997,0002,285,568
3Sep 20, 2025 08:3310,636113,719,03186,274,0002,006,0002,269,184
4Sep 20, 2025 08:3310,645110,907,07687,352,0001,004,0002,277,376
5Sep 20, 2025 08:3310,651116,068,45086,391,0002,009,0002,285,568
6Sep 20, 2025 08:3310,820116,264,84988,808,000997,0002,285,568