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 25, 2026 01:04Andrew EpsteinAndrew EpsteinScore: 211,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 01:05211,3301,046,055,9361,034,417,0001,102,0002,117,632stderr
2Sep 25, 2026 01:05211,3961,047,116,8271,034,734,0001,111,0002,117,632stderr
3Sep 25, 2026 01:05211,4111,047,151,2221,034,800,0001,118,0002,117,632stderr
4Sep 25, 2026 01:05211,4211,047,104,2571,034,849,0001,116,0002,117,632stderr
5Sep 25, 2026 01:05211,4281,046,524,7451,034,894,0001,106,0002,117,632stderr
6Sep 25, 2026 01:05211,4351,046,661,1281,034,919,0001,113,0002,117,632stderr
7Sep 25, 2026 01:05211,4411,046,552,7281,034,948,0001,113,0002,117,632stderr
8Sep 25, 2026 01:05211,4611,047,136,0041,035,045,0001,118,0002,117,632stderr
9Sep 25, 2026 01:05211,4771,046,742,1321,035,124,0001,117,0002,117,632stderr