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 3, 2026 16:22Josu San MartinJosu San MartinScore: 27,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 16:2327,543143,359,206133,702,0001,260,0002,113,536
2Aug 3, 2026 16:2327,566143,527,897133,815,0001,261,0002,113,536
3Aug 3, 2026 16:2327,578143,572,217134,059,0001,075,0002,113,536
4Aug 3, 2026 16:2327,580143,313,799134,041,0001,101,0002,113,536
5Aug 3, 2026 16:2327,604143,706,048134,254,0001,008,0002,113,536
6Aug 3, 2026 16:2327,655144,630,483134,248,0001,265,0002,113,536
7Aug 3, 2026 16:2327,819144,761,599135,047,0001,270,0002,113,536
8Aug 3, 2026 16:2327,832145,503,676135,368,0001,012,0002,113,536
9Aug 3, 2026 16:2327,890145,755,206135,539,0001,126,0002,113,536