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 19:57Tomislav TunkovicTomislav TunkovicScore: 37,060Success
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 20:0036,878188,913,084179,540,0001,166,0002,117,632
2Aug 13, 2026 20:0036,884188,920,988179,603,0001,131,0002,117,632
3Aug 13, 2026 20:0037,003189,502,135180,148,0001,169,0002,117,632
4Aug 13, 2026 20:0037,030189,608,255180,271,0001,176,0002,117,632
5Aug 13, 2026 20:0037,060189,898,057180,413,0001,181,0002,117,632
6Aug 13, 2026 20:0037,072189,887,640180,571,0001,083,0002,117,632
7Aug 13, 2026 20:0037,228190,662,579181,331,0001,088,0002,117,632
8Aug 13, 2026 20:0037,318191,258,549181,702,0001,160,0002,117,632
9Aug 13, 2026 20:0038,046195,021,686185,420,0001,009,0002,117,632