Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listSep 23, 2026 21:48Kevin HeaveyKevin HeaveyScore: 24,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 21:4924,834130,563,019120,626,0001,065,00020,480
2Sep 23, 2026 21:4924,840130,732,485120,656,0001,062,00020,480
3Sep 23, 2026 21:4924,851130,475,708120,711,0001,059,00020,480
4Sep 23, 2026 21:4924,853130,657,758120,716,0001,066,00020,480
5Sep 23, 2026 21:4924,871130,672,062120,813,0001,056,00020,480
6Sep 23, 2026 21:4924,871130,741,558120,809,0001,061,00020,480
7Sep 23, 2026 21:4924,873130,693,727120,801,0001,080,00020,480
8Sep 23, 2026 21:4924,890130,721,550120,899,0001,062,00020,480
9Sep 23, 2026 21:4924,906130,823,133120,984,0001,060,00020,480