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:45anboto1anboto1Score: 57,974Success
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:4757,546290,438,633280,880,0001,098,0002,113,536
2Aug 3, 2026 20:4757,624290,804,309281,266,0001,096,0002,113,536
3Aug 3, 2026 20:4757,626290,835,795281,353,0001,015,0002,113,536
4Aug 3, 2026 20:4757,746291,426,823281,859,0001,097,0002,113,536
5Aug 3, 2026 20:4757,974292,621,027282,970,0001,103,0002,113,536
6Aug 3, 2026 20:4758,041293,447,469283,292,0001,111,0002,113,536
7Aug 3, 2026 20:4758,240293,812,999284,284,0001,092,0002,113,536
8Aug 3, 2026 20:4758,695295,861,924286,491,0001,118,0002,113,536
9Aug 3, 2026 20:4758,849296,933,318287,207,0001,154,0002,113,536