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 24, 2026 19:03Andrew EpsteinAndrew EpsteinScore: 36,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 19:0536,880191,177,518179,600,0001,112,0002,117,632stderr
2Sep 24, 2026 19:0536,887191,268,052179,639,0001,111,0002,117,632stderr
3Sep 24, 2026 19:0536,914191,976,322179,760,0001,121,0002,117,632stderr
4Sep 24, 2026 19:0536,919191,352,902179,798,0001,109,0002,117,632stderr
5Sep 24, 2026 19:0536,923192,081,708179,790,0001,134,0002,117,632stderr
6Sep 24, 2026 19:0536,941191,508,802179,873,0001,140,0002,117,632stderr
7Sep 24, 2026 19:0538,458198,827,526187,337,0001,111,0002,117,632stderr
8Sep 24, 2026 19:0538,492199,694,067187,504,0001,109,0002,117,632stderr
9Sep 24, 2026 19:0538,506199,864,021187,558,0001,122,0002,117,632stderr