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 09:37wnwnScore: 264,800Success
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 09:39263,7041,302,306,1561,290,123,0002,027,0002,113,536
2May 11, 2026 09:39263,7461,302,809,2071,291,349,0001,008,0002,113,536
3May 11, 2026 09:39264,3421,305,876,6371,294,278,0001,001,0002,113,536
4May 11, 2026 09:39264,4141,306,376,4821,293,586,0002,045,0002,113,536
5May 11, 2026 09:39264,8001,308,354,6481,296,520,0001,001,0002,113,536
6May 11, 2026 09:39265,6811,310,550,7331,300,836,0001,001,0002,113,536
7May 11, 2026 09:39267,1861,317,995,1571,308,211,0001,002,0002,113,536
8May 11, 2026 09:39267,2821,318,415,0391,307,672,0002,012,0002,113,536
9May 11, 2026 09:39268,1961,323,862,8441,312,073,0002,090,0002,113,536