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 15:17Andrew EpsteinAndrew EpsteinScore: 268,716Success
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 15:19268,6461,326,668,8691,315,359,0001,009,0002,117,632stderr
2Sep 24, 2026 15:19268,7011,326,972,9281,315,631,0001,005,0002,117,632stderr
3Sep 24, 2026 15:19268,7021,327,075,7351,315,642,0001,000,0002,117,632stderr
4Sep 24, 2026 15:19268,7041,326,885,7921,315,640,0001,011,0002,117,632stderr
5Sep 24, 2026 15:19268,7161,327,039,0981,315,706,0001,004,0002,117,632stderr
6Sep 24, 2026 15:19268,7401,327,254,6611,315,822,0001,005,0002,117,632stderr
7Sep 24, 2026 15:19268,7441,327,162,5751,315,847,0001,003,0002,117,632stderr
8Sep 24, 2026 15:19268,7871,327,438,5391,316,058,0001,002,0002,117,632stderr
9Sep 24, 2026 15:19268,9071,328,023,6711,316,640,0001,006,0002,117,632stderr