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 2, 2026 22:27Josu San MartinJosu San MartinScore: 31,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 22:2831,333163,529,047152,420,0001,116,0002,113,536
2Aug 2, 2026 22:2831,335163,647,439152,429,0001,117,0002,113,536
3Aug 2, 2026 22:2831,336163,542,095152,426,0001,123,0002,113,536
4Aug 2, 2026 22:2831,356163,631,290152,523,0001,124,0002,113,536
5Aug 2, 2026 22:2831,359165,127,205152,532,0001,128,0002,113,536
6Aug 2, 2026 22:2831,361163,693,529152,554,0001,118,0002,113,536
7Aug 2, 2026 22:2831,393163,820,013152,666,0001,160,0002,113,536
8Aug 2, 2026 22:2831,484165,136,403153,150,0001,126,0002,113,536
9Aug 2, 2026 22:2831,516164,417,015153,314,0001,119,0002,113,536