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 00:23Josu San MartinJosu San MartinScore: 28,082Success
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 00:2328,025145,485,411136,051,0001,273,0002,113,536
2Aug 4, 2026 00:2328,041145,865,325136,129,0001,274,0002,113,536
3Aug 4, 2026 00:2328,045146,567,419136,412,0001,011,0002,113,536
4Aug 4, 2026 00:2328,066146,059,555136,374,0001,152,0002,113,536
5Aug 4, 2026 00:2328,082145,987,011136,350,0001,253,0002,113,536
6Aug 4, 2026 00:2328,083146,081,784136,346,0001,262,0002,113,536
7Aug 4, 2026 00:2328,084146,131,556136,354,0001,258,0002,113,536
8Aug 4, 2026 00:2328,101146,843,021136,426,0001,273,0002,113,536
9Aug 4, 2026 00:2328,557148,958,525138,683,0001,249,0002,113,536