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 21:16Michael KlimenkoMichael KlimenkoScore: 90,587Success
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 21:1690,550777,669,658749,563,0001,998,0002,281,472
2Nov 6, 2024 21:1690,558774,329,680749,635,0001,999,0002,281,472
3Nov 6, 2024 21:1690,570777,158,565749,732,0001,999,0002,289,664
4Nov 6, 2024 21:1690,580777,236,755749,818,0001,999,0002,523,136
5Nov 6, 2024 21:1690,587775,108,535749,869,0001,999,0002,265,088
6Nov 6, 2024 21:1690,613779,846,213750,084,0002,000,0002,281,472
7Nov 6, 2024 21:1691,039783,128,974753,626,0001,999,0002,531,328
8Nov 6, 2024 21:1691,151782,442,732754,556,0001,998,0002,289,664
9Nov 6, 2024 21:1691,402787,325,804757,641,000999,0002,265,088