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 20:15Josu San MartinJosu San MartinScore: 29,912Success
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 20:1529,896157,279,606145,360,0001,134,0002,113,536
2Aug 2, 2026 20:1529,898157,226,805145,373,0001,132,0002,113,536
3Aug 2, 2026 20:1529,910156,633,369145,433,0001,126,0002,113,536
4Aug 2, 2026 20:1529,910156,681,139145,423,0001,138,0002,113,536
5Aug 2, 2026 20:1529,912156,864,248145,425,0001,144,0002,113,536
6Aug 2, 2026 20:1529,920157,440,563145,465,0001,144,0002,113,536
7Aug 2, 2026 20:1529,921157,367,371145,488,0001,128,0002,113,536
8Aug 2, 2026 20:1529,941156,733,420145,584,0001,128,0002,113,536
9Aug 2, 2026 20:1530,205158,027,876146,876,0001,133,0002,113,536