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 14:09Josu San MartinJosu San MartinScore: 31,235Success
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 14:1031,037162,057,994150,968,0001,114,0002,113,536
2Aug 2, 2026 14:1031,058162,251,831151,052,0001,136,0002,113,536
3Aug 2, 2026 14:1031,082163,054,165151,171,0001,131,0002,113,536
4Aug 2, 2026 14:1031,218162,992,362151,866,0001,107,0002,113,536
5Aug 2, 2026 14:1031,235164,485,052151,928,0001,124,0002,113,536
6Aug 2, 2026 14:1031,237163,781,648151,944,0001,121,0002,113,536
7Aug 2, 2026 14:1031,262163,654,742152,068,0001,120,0002,113,536
8Aug 2, 2026 14:1031,288163,324,834152,196,0001,119,0002,113,536
9Aug 2, 2026 14:1031,292164,100,706152,200,0001,135,0002,113,536