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 15, 2026 01:01zielajzielajScore: 24,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 01:0224,253126,386,955116,835,0002,009,0002,117,632stderr
2May 15, 2026 01:0224,255126,882,612117,844,0001,008,0002,117,632stderr
3May 15, 2026 01:0224,258126,967,498117,854,0001,011,0002,117,632stderr
4May 15, 2026 01:0224,268126,256,533116,890,0002,028,0002,117,632stderr
5May 15, 2026 01:0224,272127,345,167116,929,0002,005,0002,117,632stderr
6May 15, 2026 01:0224,306127,004,795116,918,0002,182,0002,117,632stderr
7May 15, 2026 01:0224,321127,807,651116,908,0002,269,0002,117,632stderr
8May 15, 2026 01:0225,300133,026,494122,951,0001,019,0002,117,632stderr
9May 15, 2026 01:0226,130137,288,298127,026,0001,013,0002,117,632stderr