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 19:51Josu San MartinJosu San MartinScore: 31,421Success
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 19:5231,258163,299,544152,043,0001,123,0002,113,536
2Aug 2, 2026 19:5231,262164,384,173152,039,0001,149,0002,113,536
3Aug 2, 2026 19:5231,271163,141,532152,112,0001,116,0002,113,536
4Aug 2, 2026 19:5231,316164,220,883152,310,0001,143,0002,113,536
5Aug 2, 2026 19:5231,421164,750,911152,821,0001,142,0002,113,536
6Aug 2, 2026 19:5231,423164,004,464152,828,0001,148,0002,113,536
7Aug 2, 2026 19:5231,587164,815,004153,645,0001,135,0002,113,536
8Aug 2, 2026 19:5231,948166,650,622155,421,0001,127,0002,113,536
9Aug 2, 2026 19:5232,187167,793,417156,589,0001,131,0002,113,536