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 2, 2026 20:04Josu San MartinJosu San MartinScore: 32,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:0532,635170,083,852158,783,0001,130,0002,113,536
2Aug 2, 2026 20:0532,635170,742,067158,778,0001,134,0002,113,536
3Aug 2, 2026 20:0532,637170,118,458158,782,0001,142,0002,113,536
4Aug 2, 2026 20:0532,637170,035,582158,806,0001,120,0002,113,536
5Aug 2, 2026 20:0532,638170,247,792158,820,0001,111,0002,113,536
6Aug 2, 2026 20:0532,649172,722,583158,842,0001,139,0002,113,536
7Aug 2, 2026 20:0532,650170,113,953158,880,0001,109,0002,113,536
8Aug 2, 2026 20:0532,681170,128,523159,013,0001,127,0002,113,536
9Aug 2, 2026 20:0533,441174,364,160162,721,0001,144,0002,113,536