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 12:03Josu San MartinJosu San MartinScore: 25,500Success
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 12:0425,400132,805,440123,203,0001,260,0002,113,536
2Aug 4, 2026 12:0425,430133,651,409123,596,0001,013,0002,113,536
3Aug 4, 2026 12:0425,492134,018,325123,631,0001,280,0002,113,536
4Aug 4, 2026 12:0425,497133,331,650123,675,0001,263,0002,113,536
5Aug 4, 2026 12:0425,500134,052,611123,698,0001,254,0002,113,536
6Aug 4, 2026 12:0425,503133,333,026123,696,0001,273,0002,113,536
7Aug 4, 2026 12:0425,507133,452,838123,730,0001,259,0002,113,536
8Aug 4, 2026 12:0425,514139,668,797123,734,0001,285,0002,113,536
9Aug 4, 2026 12:0425,533133,612,674123,940,0001,175,0002,113,536