Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listNov 6, 2024 15:24NoSIMD_C#NoSIMD_C#Score: 102,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 15:24102,144878,436,159720,825,000126,969,0002,293,760
2Nov 6, 2024 15:24102,537877,848,404733,047,000118,007,0002,293,760
3Nov 6, 2024 15:24102,586878,933,466726,540,000124,921,0002,293,760
4Nov 6, 2024 15:24102,594877,720,009733,593,000117,934,0002,293,760
5Nov 6, 2024 15:24102,596876,665,476738,610,000112,940,0002,310,144
6Nov 6, 2024 15:24102,613880,522,426724,734,000126,953,0002,318,336
7Nov 6, 2024 15:24102,768879,492,582715,978,000136,995,0002,539,520
8Nov 6, 2024 15:24102,807881,067,220725,405,000127,895,0002,535,424
9Nov 6, 2024 15:24103,076883,583,329719,607,000135,925,0002,293,760