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 listOct 15, 2024 14:10Elnur RakhmatullinElnur RakhmatullinScore: 143,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 14:10143,4911,218,341,8811,135,977,00054,998,0002,293,760
2Oct 15, 2024 14:10143,5751,214,762,8241,114,696,00076,979,0002,281,472
3Oct 15, 2024 14:10143,6121,213,518,2061,117,979,00073,998,0002,265,088
4Oct 15, 2024 14:10143,6281,223,526,5961,130,157,00061,953,0002,269,184
5Oct 15, 2024 14:10143,6291,218,293,4711,122,175,00069,948,0002,289,664
6Oct 15, 2024 14:10143,6451,220,863,4281,124,300,00067,957,0002,289,664
7Oct 15, 2024 14:10143,6501,212,845,4771,115,345,00076,954,0002,281,472
8Oct 15, 2024 14:10143,6601,217,872,9951,131,406,00060,968,0002,269,184
9Oct 15, 2024 14:10143,6691,215,097,2491,121,489,00070,967,0002,269,184