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 12:33Josu San MartinJosu San MartinScore: 33,936Success
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 12:3433,751175,682,642164,249,0001,133,0002,113,536
2Aug 2, 2026 12:3433,773175,507,881164,372,0001,119,0002,113,536
3Aug 2, 2026 12:3433,774175,586,413164,365,0001,130,0002,113,536
4Aug 2, 2026 12:3433,799175,601,686164,507,0001,110,0002,113,536
5Aug 2, 2026 12:3433,936176,245,605165,155,0001,134,0002,113,536
6Aug 2, 2026 12:3433,954176,596,762165,242,0001,135,0002,113,536
7Aug 2, 2026 12:3433,994176,528,482165,289,0001,286,0002,113,536
8Aug 2, 2026 12:3434,085177,727,366165,894,0001,123,0002,113,536
9Aug 2, 2026 12:3435,101182,052,628170,886,0001,112,0002,113,536