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 14:30Josu San MartinJosu San MartinScore: 25,277Success
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 14:3125,196131,936,204122,209,0001,256,0002,113,536
2Aug 4, 2026 14:3125,210131,938,296122,282,0001,249,0002,113,536
3Aug 4, 2026 14:3125,239132,150,179122,631,0001,042,0002,113,536
4Aug 4, 2026 14:3125,266132,307,744122,554,0001,254,0002,113,536
5Aug 4, 2026 14:3125,277133,026,636122,850,0001,009,0002,113,536
6Aug 4, 2026 14:3125,281133,012,205122,853,0001,027,0002,113,536
7Aug 4, 2026 14:3125,360132,688,327123,017,0001,250,0002,113,536
8Aug 4, 2026 14:3125,370135,032,113123,041,0001,272,0002,113,536
9Aug 4, 2026 14:3125,477133,309,306123,815,0001,024,0002,113,536