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 23:07Josu San MartinJosu San MartinScore: 30,553Success
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 23:0830,506160,259,381148,354,0001,129,0002,113,536
2Aug 2, 2026 23:0830,507159,509,274148,364,0001,124,0002,113,536
3Aug 2, 2026 23:0830,510160,234,961148,366,0001,136,0002,113,536
4Aug 2, 2026 23:0830,521160,375,249148,401,0001,152,0002,113,536
5Aug 2, 2026 23:0830,553160,508,465148,573,0001,138,0002,113,536
6Aug 2, 2026 23:0830,557160,469,913148,403,0001,327,0002,113,536
7Aug 2, 2026 23:0830,654161,079,154149,075,0001,134,0002,113,536
8Aug 2, 2026 23:0830,704161,235,155149,322,0001,128,0002,113,536
9Aug 2, 2026 23:0830,724160,618,176149,428,0001,123,0002,113,536