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 4, 2026 15:55Josu San MartinJosu San MartinScore: 25,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 15:5525,151131,673,538121,979,0001,264,0002,113,536
2Aug 4, 2026 15:5525,167132,350,005122,056,0001,264,0002,113,536
3Aug 4, 2026 15:5525,171132,374,576122,077,0001,265,0002,113,536
4Aug 4, 2026 15:5525,174131,770,422122,093,0001,264,0002,113,536
5Aug 4, 2026 15:5525,180132,379,363122,357,0001,028,0002,113,536
6Aug 4, 2026 15:5525,230132,104,159122,366,0001,261,0002,113,536
7Aug 4, 2026 15:5525,232131,937,454122,387,0001,254,0002,113,536
8Aug 4, 2026 15:5525,235132,636,245122,400,0001,255,0002,113,536
9Aug 4, 2026 15:5526,581138,670,140128,997,0001,254,0002,113,536