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 13:29Kevin HeaveyKevin HeaveyScore: 36,390Success
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 13:3036,167187,666,437176,115,0001,107,00020,480
2Sep 23, 2026 13:3036,196188,585,111176,235,0001,129,00020,480
3Sep 23, 2026 13:3036,316188,347,353176,843,0001,107,00020,480
4Sep 23, 2026 13:3036,379188,558,548177,146,0001,113,00020,480
5Sep 23, 2026 13:3036,390189,430,698177,194,0001,120,00020,480
6Sep 23, 2026 13:3036,406188,816,207177,282,0001,112,00020,480
7Sep 23, 2026 13:3036,650189,912,262178,482,0001,106,00020,480
8Sep 23, 2026 13:3037,080192,100,644180,587,0001,107,00020,480
9Sep 23, 2026 13:3038,688199,997,721188,441,0001,132,00020,480