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:36Andrew EpsteinAndrew EpsteinScore: 247,636Success
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:37246,9791,220,736,1741,209,079,0001,120,0002,117,632stderr
2Sep 24, 2026 15:37247,0361,221,719,0301,209,364,0001,117,0002,117,632stderr
3Sep 24, 2026 15:37247,0611,221,876,9521,209,481,0001,122,0002,117,632stderr
4Sep 24, 2026 15:37247,3761,222,668,3851,211,048,0001,097,0002,117,632stderr
5Sep 24, 2026 15:37247,6361,224,016,1391,212,312,0001,105,0002,117,632stderr
6Sep 24, 2026 15:37247,7741,225,209,3061,212,977,0001,117,0002,117,632stderr
7Sep 24, 2026 15:37247,7771,225,279,9291,212,992,0001,117,0002,117,632stderr
8Sep 24, 2026 15:37247,7841,224,720,4181,212,979,0001,167,0002,117,632stderr
9Sep 24, 2026 15:37247,7981,225,345,3691,213,100,0001,113,0002,117,632stderr