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 10:33Josu San MartinJosu San MartinScore: 26,223Success
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 10:3326,155137,255,368126,908,0001,253,0002,113,536
2Aug 4, 2026 10:3326,170136,585,782126,973,0001,261,0002,113,536
3Aug 4, 2026 10:3326,181136,771,367127,271,0001,018,0002,113,536
4Aug 4, 2026 10:3326,221140,347,418127,466,0001,020,0002,113,536
5Aug 4, 2026 10:3326,223137,580,250127,243,0001,254,0002,113,536
6Aug 4, 2026 10:3326,233137,615,561127,270,0001,272,0002,113,536
7Aug 4, 2026 10:3326,302137,907,924127,630,0001,250,0002,113,536
8Aug 4, 2026 10:3326,329138,062,869127,750,0001,264,0002,113,536
9Aug 4, 2026 10:3327,470143,638,981133,354,0001,249,0002,113,536