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 11, 2026 14:47wnwnScore: 102,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 14:49102,050507,758,996499,042,0001,004,0002,113,536
2May 11, 2026 14:49102,082509,178,119499,199,0001,005,0002,113,536
3May 11, 2026 14:49102,111508,174,421499,340,0001,004,0002,113,536
4May 11, 2026 14:49102,134509,696,658499,454,0001,004,0002,113,536
5May 11, 2026 14:49102,137508,849,220499,473,0001,003,0002,113,536
6May 11, 2026 14:49102,174508,623,931499,653,0001,004,0002,113,536
7May 11, 2026 14:49102,291510,773,773500,227,0001,003,0002,113,536
8May 11, 2026 14:49102,320509,170,978499,348,0002,021,0002,113,536
9May 11, 2026 14:49102,333509,342,134500,430,0001,004,0002,113,536