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 07:46wnwnScore: 112,672Success
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 07:46111,942561,106,956545,347,0003,171,0002,113,536
2May 11, 2026 07:46111,963559,328,510545,620,0003,003,0002,113,536
3May 11, 2026 07:46111,964560,193,312545,573,0003,055,0002,113,536
4May 11, 2026 07:46112,022557,796,909545,906,0003,003,0002,113,536
5May 11, 2026 07:46112,672563,323,348549,061,0003,036,0002,113,536
6May 11, 2026 07:46112,686562,723,142549,038,0003,127,0002,113,536
7May 11, 2026 07:46112,694560,941,946549,166,0003,036,0002,113,536
8May 11, 2026 07:46113,443566,034,289552,826,0003,047,0002,113,536
9May 11, 2026 07:46114,335569,571,427557,237,0003,007,0002,113,536