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 29, 2026 01:28Josu San MartinJosu San MartinScore: 24,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:2824,722129,539,975119,895,0001,247,0002,113,536
2Aug 29, 2026 01:2824,812130,158,350120,573,0001,006,0002,113,536
3Aug 29, 2026 01:2824,867130,192,704120,602,0001,247,0002,113,536
4Aug 29, 2026 01:2824,918130,489,711120,838,0001,261,0002,113,536
5Aug 29, 2026 01:2824,921130,532,436120,844,0001,270,0002,113,536
6Aug 29, 2026 01:2824,936130,546,165120,936,0001,252,0002,113,536
7Aug 29, 2026 01:2824,979130,807,861121,149,0001,251,0002,113,536
8Aug 29, 2026 01:2825,050131,152,249121,489,0001,257,0002,113,536
9Aug 29, 2026 01:2825,134131,551,749121,898,0001,262,0002,113,536