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 listAug 3, 2026 21:35anboto1anboto1Score: 57,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:3657,596291,375,731281,094,0001,131,0002,113,536
2Aug 3, 2026 21:3657,599291,307,510281,150,0001,089,0002,113,536
3Aug 3, 2026 21:3657,661291,615,949281,434,0001,107,0002,113,536
4Aug 3, 2026 21:3657,665291,060,868281,472,0001,089,0002,113,536
5Aug 3, 2026 21:3657,678291,778,155281,500,0001,123,0002,113,536
6Aug 3, 2026 21:3657,695291,708,575281,606,0001,102,0002,113,536
7Aug 3, 2026 21:3657,752292,050,751281,901,0001,087,0002,113,536
8Aug 3, 2026 21:3657,763291,539,201281,854,0001,186,0002,113,536
9Aug 3, 2026 21:3658,352294,945,348284,781,0001,148,0002,113,536