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 2, 2026 20:31anboto1anboto1Score: 61,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:3261,745312,667,788301,433,0001,120,0002,113,536
2Aug 2, 2026 20:3261,754312,573,174301,481,0001,114,0002,113,536
3Aug 2, 2026 20:3261,775312,839,029301,579,0001,119,0002,113,536
4Aug 2, 2026 20:3261,850313,154,467301,939,0001,128,0002,113,536
5Aug 2, 2026 20:3261,865316,058,441302,015,0001,125,0002,113,536
6Aug 2, 2026 20:3262,107315,010,981303,217,0001,110,0002,113,536
7Aug 2, 2026 20:3262,260315,066,059303,959,0001,116,0002,113,536
8Aug 2, 2026 20:3264,143335,415,166313,104,0001,200,0002,113,536
9Aug 2, 2026 20:3265,124329,194,415317,985,0001,124,0002,113,536