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 02:36Josu San MartinJosu San MartinScore: 27,110Success
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 02:3627,074141,699,140131,410,0001,256,0002,113,536
2Aug 4, 2026 02:3627,082141,187,415131,651,0001,055,0002,113,536
3Aug 4, 2026 02:3627,085141,788,811131,464,0001,257,0002,113,536
4Aug 4, 2026 02:3627,087140,977,790131,714,0001,016,0002,113,536
5Aug 4, 2026 02:3627,110141,952,414131,822,0001,021,0002,113,536
6Aug 4, 2026 02:3627,226141,913,235132,130,0001,279,0002,113,536
7Aug 4, 2026 02:3627,326143,010,255132,637,0001,261,0002,113,536
8Aug 4, 2026 02:3627,376143,266,011132,890,0001,256,0002,113,536
9Aug 4, 2026 02:3627,459143,610,365133,288,0001,265,0002,113,536