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 03:58Josu San MartinJosu San MartinScore: 27,294Success
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 03:5927,189141,634,683131,960,0001,267,0002,113,536
2Aug 4, 2026 03:5927,204141,725,888132,033,0001,268,0002,113,536
3Aug 4, 2026 03:5927,217142,468,818132,103,0001,262,0002,113,536
4Aug 4, 2026 03:5927,248143,889,702132,509,0001,009,0002,113,536
5Aug 4, 2026 03:5927,294142,156,682132,481,0001,260,0002,113,536
6Aug 4, 2026 03:5927,310142,207,126132,547,0001,272,0002,113,536
7Aug 4, 2026 03:5927,354142,311,432132,762,0001,277,0002,113,536
8Aug 4, 2026 03:5928,724149,884,985139,737,0001,013,0002,113,536
9Aug 4, 2026 03:5928,741148,996,081139,822,0001,010,0002,113,536