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 listDec 26, 2024 01:58Joad NacerJoad NacerScore: 187,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2024 01:58187,432942,656,542917,419,000999,0002,269,184
2Dec 26, 2024 01:58187,451940,360,262917,511,000999,0002,531,328
3Dec 26, 2024 01:58187,454941,738,755916,526,0001,998,0002,531,328
4Dec 26, 2024 01:58187,456942,028,099917,534,000999,0002,269,184
5Dec 26, 2024 01:58187,468943,028,688917,592,000999,0002,424,832
6Dec 26, 2024 01:58187,496942,275,641918,731,00002,428,928
7Dec 26, 2024 01:58187,507937,994,194918,783,00002,510,848
8Dec 26, 2024 01:58187,516946,658,238918,829,00002,531,328
9Dec 26, 2024 01:58187,619942,640,890917,337,0001,998,0002,269,184