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 00:07Josu San MartinJosu San MartinScore: 24,516Success
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 00:0824,512129,306,096118,834,0001,276,0002,113,536
2Aug 29, 2026 00:0824,513128,540,824118,871,0001,247,0002,113,536
3Aug 29, 2026 00:0824,514128,494,935118,868,0001,254,0002,113,536
4Aug 29, 2026 00:0824,516128,520,979118,876,0001,254,0002,113,536
5Aug 29, 2026 00:0824,516128,489,436118,874,0001,255,0002,113,536
6Aug 29, 2026 00:0824,517128,547,690118,883,0001,252,0002,113,536
7Aug 29, 2026 00:0824,552128,674,605119,134,0001,173,0002,113,536
8Aug 29, 2026 00:0825,733134,568,741124,828,0001,266,0002,113,536
9Aug 29, 2026 00:0826,406137,741,387128,138,0001,256,0002,113,536