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 13, 2026 18:38Tomislav TunkovicTomislav TunkovicScore: 37,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 18:3937,106190,500,877180,665,0001,155,0002,117,632
2Aug 13, 2026 18:3937,263191,130,545181,423,0001,167,0002,117,632
3Aug 13, 2026 18:3937,276191,012,090181,494,0001,163,0002,117,632
4Aug 13, 2026 18:3937,325192,242,851181,703,0001,192,0002,117,632
5Aug 13, 2026 18:3937,345191,463,840181,834,0001,157,0002,117,632
6Aug 13, 2026 18:3937,459191,918,083182,389,0001,161,0002,117,632
7Aug 13, 2026 18:3937,508192,029,523182,591,0001,203,0002,117,632
8Aug 13, 2026 18:3937,572192,390,190182,918,0001,188,0002,117,632
9Aug 13, 2026 18:3937,616193,478,832183,148,0001,175,0002,117,632