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:40Leon ZhaoLeon ZhaoScore: 15,779Success
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:4015,773160,186,305128,918,0001,998,0002,285,568
2Aug 9, 2025 01:4015,777156,349,512128,947,0001,999,0002,473,984
3Aug 9, 2025 01:4015,777159,369,189128,953,0001,999,0002,285,568
4Aug 9, 2025 01:4015,778159,567,426128,957,0001,999,0002,285,568
5Aug 9, 2025 01:4015,779160,068,235128,963,0001,999,0002,465,792
6Aug 9, 2025 01:4015,780157,189,927128,971,0001,999,0002,478,080
7Aug 9, 2025 01:4015,782160,542,874129,994,000999,0002,285,568
8Aug 9, 2025 01:4015,787159,041,792129,036,0002,000,0002,285,568
9Aug 9, 2025 01:4015,795156,258,437130,098,0001,000,0002,306,048