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:54Josu San MartinJosu San MartinScore: 26,146Success
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:5526,060136,679,651126,447,0001,249,0002,113,536
2Aug 4, 2026 10:5526,066136,141,851126,475,0001,250,0002,113,536
3Aug 4, 2026 10:5526,072136,197,365126,702,0001,051,0002,113,536
4Aug 4, 2026 10:5526,073136,735,913126,499,0001,259,0002,113,536
5Aug 4, 2026 10:5526,146137,060,472126,852,0001,268,0002,113,536
6Aug 4, 2026 10:5526,182136,736,608127,035,0001,257,0002,113,536
7Aug 4, 2026 10:5526,195136,813,364127,342,0001,016,0002,113,536
8Aug 4, 2026 10:5526,200136,800,399127,126,0001,254,0002,113,536
9Aug 4, 2026 10:5526,320137,308,302127,712,0001,257,0002,113,536