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 02:51Josu San MartinJosu San MartinScore: 27,252Success
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 02:5127,165142,182,436131,863,0001,248,0002,113,536
2Aug 4, 2026 02:5127,220142,410,261132,113,0001,269,0002,113,536
3Aug 4, 2026 02:5127,226141,922,682132,153,0001,258,0002,113,536
4Aug 4, 2026 02:5127,230141,879,316132,170,0001,258,0002,113,536
5Aug 4, 2026 02:5127,252143,151,522132,266,0001,269,0002,113,536
6Aug 4, 2026 02:5127,270142,649,863132,367,0001,259,0002,113,536
7Aug 4, 2026 02:5127,423142,543,413133,364,0001,012,0002,113,536
8Aug 4, 2026 02:5127,899144,940,997135,703,0001,005,0002,113,536
9Aug 4, 2026 02:5128,626148,695,953139,017,0001,255,0002,113,536