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 listAug 9, 2025 01:38Leon ZhaoLeon ZhaoScore: 15,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2025 01:3815,959154,173,623131,455,0001,003,0002,461,696
2Aug 9, 2025 01:3815,963160,767,897131,489,0001,003,0002,326,528
3Aug 9, 2025 01:3815,968161,453,066131,528,0001,004,0002,473,984
4Aug 9, 2025 01:3815,971163,181,735131,552,0001,004,0002,465,792
5Aug 9, 2025 01:3815,972159,098,934131,561,0001,004,0002,285,568
6Aug 9, 2025 01:3815,973156,783,852131,572,0001,004,0002,465,792
7Aug 9, 2025 01:3815,974160,007,425130,588,0001,993,0002,285,568
8Aug 9, 2025 01:3815,975158,585,931131,590,0001,004,0002,478,080
9Aug 9, 2025 01:3815,988160,030,819130,708,0001,995,0002,289,664