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 listMar 20, 2026 17:51Dominique GarmierDominique GarmierScore: 78,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 22:0978,424676,275,905647,920,0002,999,0002,322,432
2Mar 20, 2026 17:5178,431674,598,893647,981,0002,999,0002,314,240
3Mar 20, 2026 22:0978,446677,343,985648,101,0003,000,0002,322,432
4Mar 20, 2026 20:3078,448676,976,189648,120,0003,000,0002,383,872
5Mar 20, 2026 20:3078,459672,901,062649,211,0002,000,0002,318,336
6Mar 20, 2026 17:5178,481677,324,485649,393,0001,998,0002,387,968
7Mar 20, 2026 22:0978,505676,810,882648,595,0002,998,0002,383,872
8Mar 20, 2026 20:3078,566689,687,652649,096,0003,000,0002,310,144
9Mar 20, 2026 17:5178,569682,959,546649,119,0003,000,0002,322,432