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 29, 2026 01:31Josu San MartinJosu San MartinScore: 24,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:3224,243127,703,299117,535,0001,257,0002,113,536
2Aug 29, 2026 01:3224,244127,235,185117,537,0001,260,0002,113,536
3Aug 29, 2026 01:3224,246127,217,195117,555,0001,251,0002,113,536
4Aug 29, 2026 01:3224,248127,928,941117,542,0001,277,0002,113,536
5Aug 29, 2026 01:3224,254127,291,679117,579,0001,269,0002,113,536
6Aug 29, 2026 01:3224,285127,352,911117,817,0001,181,0002,113,536
7Aug 29, 2026 01:3224,292127,429,406117,864,0001,171,0002,113,536
8Aug 29, 2026 01:3224,300127,209,755118,064,0001,006,0002,113,536
9Aug 29, 2026 01:3224,569128,773,260119,139,0001,252,0002,113,536