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 listMay 15, 2026 01:06zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 06:05M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:06044,794,16618,114,00016,772,00020,480No answer to stdout. Died or killed?stderr
2May 15, 2026 01:0724,166128,814,944116,366,0002,051,0002,117,632stderr
3May 15, 2026 01:0724,211128,610,856116,589,0002,045,0002,117,632stderr
4May 15, 2026 01:0724,250126,267,781117,804,0001,021,0002,117,632stderr
5May 15, 2026 01:0724,253126,259,702117,825,0001,017,0002,117,632stderr
6May 15, 2026 01:0724,262127,551,806116,869,0002,019,0002,117,632stderr
7May 15, 2026 01:0724,274127,756,696116,929,0002,017,0002,117,632stderr
8May 15, 2026 01:0725,374132,575,672123,327,0001,010,0002,117,632stderr
9May 15, 2026 01:0726,066138,243,985125,687,0002,037,0002,117,632stderr
10May 15, 2026 01:0726,221135,788,738126,479,0002,007,0002,117,632stderr