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 7, 2025 08:55Aleksei ShahoikaAleksei ShahoikaScore: 51,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2025 08:5551,534453,482,001425,735,0001,998,0002,387,968
2Sep 7, 2025 08:5551,660452,487,549426,780,0001,998,0002,285,568
3Sep 7, 2025 08:5551,691463,701,258428,032,0001,000,0002,510,848
4Sep 7, 2025 08:5551,717453,760,297428,250,0001,000,0002,285,568
5Sep 7, 2025 08:5551,753453,211,056427,551,0001,997,0002,285,568
6Sep 7, 2025 08:5551,782456,579,642427,795,0001,999,0002,285,568
7Sep 7, 2025 08:5551,806455,176,948427,989,0001,999,0002,285,568
8Sep 7, 2025 08:5551,905457,810,708425,813,0004,997,0002,285,568
9Sep 7, 2025 08:5554,478478,477,296451,164,0001,000,0002,285,568