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 23:23Josu San MartinJosu San MartinScore: 29,911Success
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 23:2329,899156,612,155145,384,0001,124,0002,113,536
2Aug 2, 2026 23:2329,907156,570,078145,429,0001,120,0002,113,536
3Aug 2, 2026 23:2329,908156,599,150145,430,0001,123,0002,113,536
4Aug 2, 2026 23:2329,909157,348,954145,439,0001,119,0002,113,536
5Aug 2, 2026 23:2329,911156,566,758145,446,0001,122,0002,113,536
6Aug 2, 2026 23:2329,921156,662,182145,481,0001,134,0002,113,536
7Aug 2, 2026 23:2329,923156,630,649145,495,0001,129,0002,113,536
8Aug 2, 2026 23:2329,956156,813,593145,663,0001,126,0002,113,536
9Aug 2, 2026 23:2329,960156,992,647145,665,0001,142,0002,113,536