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 listJul 31, 2026 16:08Josu San MartinJosu San MartinScore: 56,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 16:0956,148285,226,488274,014,0001,115,0002,113,536
2Jul 31, 2026 16:0956,181285,444,472274,166,0001,124,0002,113,536
3Jul 31, 2026 16:0956,201286,296,938274,265,0001,124,0002,113,536
4Jul 31, 2026 16:0956,202285,547,593274,264,0001,128,0002,113,536
5Jul 31, 2026 16:0956,213286,318,699274,313,0001,135,0002,113,536
6Jul 31, 2026 16:0956,254286,544,328274,509,0001,137,0002,113,536
7Jul 31, 2026 16:0956,392286,425,230275,206,0001,116,0002,113,536
8Jul 31, 2026 16:0958,307295,739,973284,584,0001,122,0002,113,536
9Jul 31, 2026 16:0962,974319,434,466307,446,0001,129,0002,113,536