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 listAug 3, 2026 20:34anboto1anboto1Score: 57,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:3557,688291,771,586281,561,0001,113,0002,113,536
2Aug 3, 2026 20:3557,692290,838,112281,584,0001,111,0002,113,536
3Aug 3, 2026 20:3557,714291,261,285281,589,0001,213,0002,113,536
4Aug 3, 2026 20:3557,752291,403,291281,858,0001,131,0002,113,536
5Aug 3, 2026 20:3557,774291,571,204281,975,0001,120,0002,113,536
6Aug 3, 2026 20:3557,801291,713,420282,223,0001,004,0002,113,536
7Aug 3, 2026 20:3557,814292,504,689282,289,0001,003,0002,113,536
8Aug 3, 2026 20:3559,223299,280,150289,039,0001,155,0002,113,536
9Aug 3, 2026 20:3559,421299,635,253290,049,0001,115,0002,113,536