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:43Josu San MartinJosu San MartinScore: 29,426Success
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:4429,406153,139,710142,821,0001,273,0002,113,536
2Aug 2, 2026 23:4429,415153,251,982143,124,0001,014,0002,113,536
3Aug 2, 2026 23:4429,421155,472,702143,158,0001,008,0002,113,536
4Aug 2, 2026 23:4429,422153,154,300143,129,0001,043,0002,113,536
5Aug 2, 2026 23:4429,426152,944,532143,176,0001,013,0002,113,536
6Aug 2, 2026 23:4429,434153,275,708142,956,0001,274,0002,113,536
7Aug 2, 2026 23:4429,445153,403,531143,272,0001,013,0002,113,536
8Aug 2, 2026 23:4429,560153,965,479143,836,0001,012,0002,113,536
9Aug 2, 2026 23:4429,779154,153,798144,896,0001,025,0002,113,536