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 listJul 30, 2025 18:28zielajzielajScore: 24,442Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2025 23:0224,398148,123,452119,548,00002,461,696
2Jul 30, 2025 18:2824,424145,748,651117,686,0001,994,0002,314,240
3Jul 30, 2025 23:0224,426151,973,460117,694,0001,994,0002,461,696
4Jul 30, 2025 18:2824,442143,688,042116,771,0002,994,0002,326,528
5Jul 30, 2025 18:2824,442144,320,172117,769,0001,996,0002,318,336
6Jul 30, 2025 23:0224,445142,685,399117,785,0001,996,0002,473,984