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 02:05Josu San MartinJosu San MartinScore: 27,949Success
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 02:0627,860144,973,827135,252,0001,265,0002,113,536
2Aug 4, 2026 02:0627,932145,318,641135,612,0001,259,0002,113,536
3Aug 4, 2026 02:0627,940145,919,039135,639,0001,267,0002,113,536
4Aug 4, 2026 02:0627,947147,425,490135,666,0001,279,0002,113,536
5Aug 4, 2026 02:0627,949145,929,771135,907,0001,046,0002,113,536
6Aug 4, 2026 02:0627,963145,464,742135,756,0001,263,0002,113,536
7Aug 4, 2026 02:0628,233147,358,774137,089,0001,254,0002,113,536
8Aug 4, 2026 02:0628,689148,823,918139,552,0001,028,0002,113,536
9Aug 4, 2026 02:0628,754149,337,600139,642,0001,256,0002,113,536