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 3, 2026 16:03Josu San MartinJosu San MartinScore: 28,340Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 16:0328,321147,844,279137,518,0001,259,0002,113,536
2Aug 3, 2026 16:0328,333147,937,752137,586,0001,250,0002,113,536
3Aug 3, 2026 16:0328,338147,938,093137,836,0001,022,0002,113,536
4Aug 3, 2026 16:0328,338147,919,834137,848,0001,012,0002,113,536
5Aug 3, 2026 16:0328,340147,918,636137,594,0001,272,0002,113,536
6Aug 3, 2026 16:0328,351148,040,807137,653,0001,269,0002,113,536
7Aug 3, 2026 16:0328,402148,309,773138,112,0001,061,0002,113,536
8Aug 3, 2026 16:0328,468147,831,856138,226,0001,272,0002,113,536
9Aug 3, 2026 16:0330,153156,758,401146,490,0001,263,0002,113,536