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 12, 2026 14:07wnwnScore: 98,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 14:0798,723491,228,347482,741,0001,003,0002,113,536
2May 12, 2026 14:0798,744491,340,284482,845,0001,004,0002,113,536
3May 12, 2026 14:0798,764492,000,425482,939,0001,005,0002,113,536
4May 12, 2026 14:0798,809491,672,323482,113,0002,054,0002,113,536
5May 12, 2026 14:0798,811492,331,452483,172,0001,003,0002,113,536
6May 12, 2026 14:0798,835493,687,859483,289,0001,005,0002,113,536
7May 12, 2026 14:0798,912492,446,180483,669,0001,003,0002,113,536
8May 12, 2026 14:0798,921492,053,003483,714,0001,003,0002,113,536
9May 12, 2026 14:0798,932492,211,974483,766,0001,004,0002,113,536