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 13:11Josu San MartinJosu San MartinScore: 25,935Success
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 13:1125,866135,120,688125,741,0001,003,0002,113,536
2Aug 4, 2026 13:1125,890135,206,173125,601,0001,262,0002,113,536
3Aug 4, 2026 13:1125,895135,261,552125,625,0001,263,0002,113,536
4Aug 4, 2026 13:1125,896135,155,943125,891,0001,003,0002,113,536
5Aug 4, 2026 13:1125,935135,501,567125,813,0001,269,0002,113,536
6Aug 4, 2026 13:1125,940135,494,683125,845,0001,264,0002,113,536
7Aug 4, 2026 13:1125,962136,282,999125,953,0001,262,0002,113,536
8Aug 4, 2026 13:1125,989135,727,725126,083,0001,267,0002,113,536
9Aug 4, 2026 13:1126,049136,044,367126,377,0001,266,0002,113,536