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 14:03Josu San MartinJosu San MartinScore: 25,368Success
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 14:0425,285132,876,652122,625,0001,273,0002,113,536
2Aug 4, 2026 14:0425,292132,922,120122,666,0001,269,0002,113,536
3Aug 4, 2026 14:0425,344133,128,259123,170,0001,018,0002,113,536
4Aug 4, 2026 14:0425,353133,329,347123,199,0001,035,0002,113,536
5Aug 4, 2026 14:0425,368133,417,227123,058,0001,249,0002,113,536
6Aug 4, 2026 14:0425,370133,343,766123,061,0001,254,0002,113,536
7Aug 4, 2026 14:0425,380133,944,458123,084,0001,278,0002,113,536
8Aug 4, 2026 14:0425,382133,414,850123,114,0001,261,0002,113,536
9Aug 4, 2026 14:0425,386133,548,499123,337,0001,055,0002,113,536