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 listMay 16, 2026 22:24M-RochatM-RochatScore: 123,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 22:30120,044597,021,750587,118,0001,102,0002,113,536
2May 16, 2026 22:30122,271608,031,551597,949,0001,179,0002,113,536
3May 16, 2026 22:30122,410610,719,031598,811,0001,001,0002,113,536
4May 16, 2026 22:30122,997611,605,001601,547,0001,141,0002,113,536
5May 16, 2026 22:30123,124613,950,445602,219,0001,092,0002,113,536
6May 16, 2026 22:30123,155612,238,066602,357,0001,104,0002,113,536
7May 16, 2026 22:30123,367613,402,827603,331,0001,172,0002,113,536
8May 16, 2026 22:30123,684617,374,896604,945,0001,108,0002,113,536
9May 16, 2026 22:30125,050621,869,570611,624,0001,122,0002,113,536