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 4, 2026 07:50Josu San MartinJosu San MartinScore: 26,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 07:5126,889139,972,947130,486,0001,272,0002,113,536
2Aug 4, 2026 07:5126,894140,374,697130,530,0001,251,0002,113,536
3Aug 4, 2026 07:5126,900140,856,291130,554,0001,256,0002,113,536
4Aug 4, 2026 07:5126,927140,332,664130,824,0001,120,0002,113,536
5Aug 4, 2026 07:5126,951140,569,709131,048,0001,015,0002,113,536
6Aug 4, 2026 07:5126,960140,509,869130,848,0001,257,0002,113,536
7Aug 4, 2026 07:5126,977141,302,712130,942,0001,246,0002,113,536
8Aug 4, 2026 07:5126,980141,342,027131,122,0001,080,0002,113,536
9Aug 4, 2026 07:5127,011141,480,916131,087,0001,268,0002,113,536