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 5, 2025 01:45Ian MckibbenIan MckibbenScore: 29,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2025 01:4529,599267,448,312243,672,0001,997,0002,531,328
2Mar 5, 2025 01:4529,608269,595,470244,751,000998,0002,531,328
3Mar 5, 2025 01:4529,612272,230,867245,776,00002,531,328
4Mar 5, 2025 01:4529,617271,514,059244,825,000999,0002,531,328
5Mar 5, 2025 01:4529,620272,834,041244,845,000999,0002,265,088
6Mar 5, 2025 01:4529,628268,729,481244,915,000999,0002,437,120
7Mar 5, 2025 01:4529,633269,460,250243,954,0001,999,0002,269,184
8Mar 5, 2025 01:4529,635269,346,901243,968,0001,999,0002,433,024
9Mar 5, 2025 01:4529,639280,848,414244,003,0002,000,0002,437,120